Introduction to Management Science, 11e (Taylor)

Chapter 5 Integer Programming

1) The three types of integer programming models are total, 0-1, and mixed.
Answer: TRUE
Diff: 1 Page Ref: 185
Section Heading: Integer Programming Models
Keywords: integer programming models

2) In a total integer model, all decision variables have integer solution values.
Answer: TRUE
Diff: 1 Page Ref: 185
Section Heading: Integer Programming Models
Keywords: integer programming models

3) In a 0-1 integer model, the solution values of the decision variables are 0 or 1.
Answer: TRUE
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming models

4) In a mixed integer model, some solution values for decision variables are integer and others can be
non-integer.
Answer: TRUE
Diff: 1 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer programming models

5) The college dean is deciding among three equally qualified (in their eyes, at least) candidates for his
associate dean position. If this situation could be modeled as an integer program, the decision variables
would be cast as 0-1 integer variables.
Answer: TRUE
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: 0-1 variables, conditional constraints
AACSB: Analytic skills

6) The management scientist's fiance informed him that if they were to be married, he would also have
to welcome her mother into their home. The management scientist should model this decision as a
contingency constraint.
Answer: FALSE
Diff: 1 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: corequisite constraints, 0-1 variables

1
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
7) In the classic game show Password, the suave, silver-haired host informed the contestants, "you can
choose to pass or to play." This expression suggests a mixed integer model is most appropriate.
Answer: FALSE
Diff: 1 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer linear programming models, 0-1 variables
AACSB: Analytic skills

8) The production planner for Airbus showed his boss the latest product mix suggestion from their slick
new linear programming model: 12.5 model 320s and 17.4 model 340s. The boss looked over his glasses
at the production planner and reminded him that they had several half airplanes from last year's
production rusting in the parking lot. No one, it seems, is interested in half of an airplane. The
production planner whipped out his red pen and crossed out the .5 and .4, turning the new plan into 12
model 320s and 17 model 340s. This production plan is definitely feasible.
Answer: TRUE
Diff: 1 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming graphical solution
AACSB: Analytic skills

9) In a mixed integer model, all decision variables have integer solution values.
Answer: FALSE
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer programming models

10) In a mixed integer model, the solution values of the decision variables are 0 or 1.
Answer: FALSE
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer programming models

11) The branch and bound method can only be used for maximization integer programming problems.
Answer: FALSE
Diff: 1 Page Ref: 190
Section Heading: Integer Programming Models
Keywords: integer programming models, branch and bound
AACSB: Analytic skills

12) The branch and bound solution method cannot be applied to 0-1 integer programming problems.
Answer: FALSE
Diff: 2 Page Ref: 190
Section Heading: Integer Programming Models
Keywords: integer programming models, branch and bound method

2
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
13) In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or
rejection of the different projects.
Answer: TRUE
Diff: 2 Page Ref: 200
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: capital budgeting, 0-1 variables
AACSB: Analytic skills

14) In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if
project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected,
project 1 cannot be selected.
Answer: FALSE
Diff: 2 Page Ref: 200
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: capital budgeting, 0-1 variables
AACSB: Analytic skills

15) The divisibility assumption is violated by integer programming.

Answer: TRUE
Diff: 1 Page Ref: 185
Section Heading: Integer Programming Models
Keywords: integer linear programming models, multiple choice constraint
AACSB: Analytic skills

16) One type of constraint in an integer program is a multiple-choice constraint.

Answer: TRUE
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming models,multiple choice constraint

17) If exactly three projects are to be selected from a set of five projects, this would be written as three
separate constraints in an integer program.
Answer: FALSE
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming models, multiple choice constraint
AACSB: Analytic skills

18) A conditional constraint specifies the conditions under which variables are integers or real variables.
Answer: FALSE
Diff: 1 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer linear programming models, constraint

3
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
19) Rounding non-integer solution values up to the nearest integer value can result in an infeasible
solution to an integer programming problem.
Answer: TRUE
Diff: 2 Page Ref: 188
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution
AACSB: Analytic skills

20) A feasible solution to an integer programming problem is ensured by rounding down non-integer
solution values.
Answer: TRUE
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution

21) An optimal solution to an integer programming problem is ensured by rounding down non-integer
solution values.
Answer: FALSE
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution
AACSB: Analytic skills

22) A rounded-down integer solution can result in a less than optimal solution to an integer
programming problem.
Answer: TRUE
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution
AACSB: Analytic skills

23) Rounding down integer solution values ensures an infeasible solution to an integer linear
programming problem.
Answer: FALSE
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution
AACSB: Analytic skills

24) Rounding non-integer solution values up to the nearest integer value will result in an infeasible
solution to an integer linear programming problem.
Answer: FALSE
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution
AACSB: Analytic skills

4
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
25) Rounding non-integer solution values up to the nearest integer value will still result in a feasible
solution.
Answer: FALSE
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models, graphical solution
AACSB: Analytic skills

26) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 + x3 ≤ 3 is a mutually
exclusive constraint.
Answer: FALSE
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming models, 0-1 variables
AACSB: Analytic skills

27) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 ≤ 1 is a mutually
exclusive constraint.
Answer: TRUE
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming models, 0-1 variables
AACSB: Analytic skills

28) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a mutually
exclusive constraint.
Answer: FALSE
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: 0-1 variables, multiple choice constraint
AACSB: Analytic skills

29) If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a mutually exclusive
constraint.
Answer: FALSE
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: 0-1 variables, conditional constraints
AACSB: Analytic skills

30) If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional
constraint.
Answer: FALSE
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: 0-1 variables, corequisite constraints
AACSB: Analytic skills

5
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
31) If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a conditional
constraint.
Answer: TRUE
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: 0-1 variables, multiple choice constraint
AACSB: Analytic skills

32) In a ________ linear programming model, some of the solution values for the decision variables are
required to assume integer values and others can be integer or noninteger.
Answer: mixed integer
Diff: 1 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer programming models, mixed integer programming models

33) In a ________ linear programming model, the solution values of the decision variables are zero or
one.
Answer: 0-1 integer
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming models, 0-1 integer programming models

34) If exactly one investment is to be selected from a set of five investment options, then the constraint
is often called a ________ constraint.
Answer: multiple-choice
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming formulation, capital budgeting

35) If we graph the problem that requires x1 and x2 to be an integer, it has a feasible region consisting of
________.
Answer: dots
Diff: 3 Page Ref: 190
Section Heading: Integer Programming Graphical Solution
Keywords: integer linear programming models, graphical solution

36) The ________ method is based on the principle that the total set of fesible solutions can be
partitioned into smaller subsets of solutions.
Answer: branch and bound
Diff: 3 Page Ref: 190
Section Heading: Integer Programming Graphical Solution
Keywords: branch and bound method

37) In a ________ integer programming model, a solution of x2 = 7 is not possible.

Answer: 0-1
Diff: 1 Page Ref: 199
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: 0-1 integer programming

6
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
38) "It's me or the cat!" the exasperated husband bellowed to his well-educated wife. "Hmmmm," she
thought, "I could model this decision with a ________ constraint."
Answer: contingency or mutually exclusive
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: mutually exclusive constraints, 0-1 variables

39) A ________ integer model allows for the possibility that some decision variables are not integers.
Answer: mixed
Diff: 1 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: mixed integer programming problem

40) In choosing four electives from the dazzling array offered by the Decision Sciences Department next
semester, the students that had already taken the management science class were able to craft a model
using a ________ constraint.
Answer: multiple-choice
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: multiple choice constraints, 0-1 variables

41) ________ variables are best suited to be the decision variables when dealing with yes-or-no
decisions.
Answer: 0-1
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming models, 0-1 variables

42) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 ≤ 1 is a ________
constraint.
Answer: mutually exclusive
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Graphical Solution
Keywords: integer linear programming models, 0-1 variables

43) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a ________
constraint.
Answer: multiple-choice
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Graphical Solution
Keywords: 0-1 variables, multiple choice constraint

44) If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a ________
constraint.
Answer: conditional
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Graphical Solution
Keywords: 0-1 variables, conditional constraints

7
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
45) If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a ________
constraint.
Answer: corequisite
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Graphical Solution
Keywords: 0-1 variables, corequisite constraints

46) If one location for a warehouse can be selected only if a specific location for a manufacturing
facility is also selected, this decision can be represented by a ________ constraint.
Answer: conditional
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer linear programming models, constraint
AACSB: Analytic skills

47) In an integer program, if we were choosing between two locations to build a facility, this would be
written as: ________.
Answer: x1 + x2 = 1
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer linear programming models, constraint
AACSB: Analytic skills

48) In an integer program, if building one facility required the construction of another type of facility,
this would be written as: ________.
Answer: x1 = x2
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: integer linear programming models, constraint
AACSB: Analytic skills

49) Consider the following integer linear programming problem:

Max Z = 3x1 + 2x2
Subject to: 3x1 + 5x2 ≤ 30
4x1 + 2x2 ≤ 28
x1 ≤ 8
x1 , x2 ≥ 0 and integer

The solution to the linear programming formulation is: x1 = 5.714, x2 = 2.571.

What is the optimal solution to the integer linear programming problem?
State the optimal values of decision variables and the value of the objective function.
Answer: x1 = 6, x2 = 2, Z = 22
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer linear programming solution
AACSB: Analytic skills

8
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
50) Consider the following integer linear programming problem:
Max Z = 3x1 + 2x2
Subject to: 3x1 + 5x2 ≤ 30
5x1 + 2x2 ≤ 28
x1 ≤ 8
x1, x2 ≥ 0 and integer

The solution to the linear programming formulation is: x1 = 5.714, x2 = 2.571.

What is the optimal solution to the integer linear programming problem?
State the optimal values of decision variables and the value of the objective function.
Answer: x1 = 4, x2 = 3, Z = 18
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer linear programming solution
AACSB: Analytic skills

Consider a capital budgeting example with five projects from which to select. Let x1 = 1 if project a is
selected, 0 if not, for a = 1, 2, 3, 4, 5. Projects cost $100, $200, $150, $75, and $300, respectively. The
budget is $450.

51) Write the appropriate constraint for the following condition: Choose no fewer than 3 projects.
Answer: x1 + x2 + x3 + x4 + x5 ≥ 3
Diff: 1 Page Ref: 200
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: formulation of 0-1 constraints
AACSB: Analytic skills

52) Write the appropriate constraint for the following condition: If project 3 is chosen, project 4 must be
chosen.
Answer: x3 - x4 ≤ 0
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: formulation of 0-1 constraints
AACSB: Analytic skills

53) Write the appropriate constraint for the following condition: If project 1 is chosen, project 5 must
not be chosen.
Answer: x1 + x5 ≤ 1
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: formulation of 0-1 constraints
AACSB: Analytic skills

9
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
Saba conducts regular tours of his favorite city in the world, Paris. Each semester he selects among the
finest students in the university and escorts them to the City of Lights. In addition to a world-class
education on conducting business in Europe, he arranges a number of cultural outings for them to help
them immerse themselves in all that France has to offer. He collects an extra $100 from each student for
this purpose and limits his tour group to ten lucky individuals. Some of the events (and their prices) he
proposes to the students include:

Eiffel Tower visit, $40 per student, E

Paris Sewer spelunking, $20 per student, S
Half day passes to the Louvre, $60 per student, L
Bon Beret tour, $50 per student, B

So much to do and so little time!

54) What would the constraints be if the Eiffel Tower visit needed to take place at the same time as the
half day at the Louvre and if students taking the Paris Sewer tour had to wear the special sanitary beret
available only from the Bon Beret tour?
Answer:
E+L≤1
S-B≤0
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: mutually exclusive constraints, 0-1 variables
AACSB: Analytic skills

55) The tour group has three days remaining in Paris and the opportunity to do three cultural events. It
is important to soak up as much culture as possible, so Saba decides to model this as a 0-1 integer
program mandating that the group does three events. A couple of students object, not to the integer
program, but to the set of cultural events that they have to choose from. They would rather have the
option to do up to three events but perhaps only one or two and spend the rest of their time doing some
"retail benchmarking." What was Saba's original constraint and how does that constraint change to cater
to the whims of the students?
Answer: Saba's original constraint was E + L + S + B = 3, which directed the group to three tours. The
new constraint is E + L + S + B ≤ 3, which allows for the possibility of no tours up to a maximum of
three tours.
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: 0-1 variables, multiple choice constraint
AACSB: Analytic skills

10
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
56) What is the full set of constraints if the following situations occur? The Eiffel Tower visit needed to
take place at the same time has the half day at the Louvre. Students taking the Paris Sewer tour had to
wear the special sanitary beret available only from the Bon Beret tour. Saba applies for university tarvel
funds and supplements the students' accounts with an extra $30 each.
Answer:
E+L≤1
S-B≤0
40E + 20S + 60L + 50B ≤ 130
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Models
Keywords: mixed integer programming problem, constraint formulation
AACSB: Analytic skills
J
The Exorbitant Course Fees. The $75 per credit hour course fee tacked on to all the MBA classes has
generated a windfall of $56,250 in its first semester. "Now we just need to make sure we spend it all,"
the Assistant Dean cackled. She charged the Graduate Curriculum Committee with generating a
shopping list before their next meeting. Four months later, the chairman of the committee distributed the
following. As the professor for the quantitative modeling course, he tended to think in terms of decision
variables, so he added the left-most column for ease of use.

Decision
Variable Item Cost Note
A iPads for everybody $750/unit Must get a cover if these are purchased
B iPad covers with MBA logo $25/unit Not needed unless we buy iPads
C Speaker series $15,000 Can't afford both this and the iPads
Subscriptions to the Wall
D Street Journal $10/unit Don't need if we have the electronic version
Subscriptions to the
electronic version of the Wall
E Street Journal $5/unit Worthless without the iPads

57) What is a full set of constraints for this problem if there are 30 MBA students enrolled this
semester?
Answer:
22,500A + 750B + 15,000C + 300D + 150E ≤ 56,250
A+C≤1
A-B=0
E-A≤0
D+E≤1
Diff: 2 Page Ref: 186-187
Section Heading: Integer Programming Models
Keywords: integer linear programming models, 0-1 variables
AACSB: Analytic skills

11
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
The Wiethoff Company has a contract to produce 10,000 garden hoses for a customer. Wiethoff has four
different machines that can produce this kind of hose. Because these machines are from different
manufacturers and use differing technologies, their specifications are not the same.

58) This problem requires two different kinds of decision variables. Clearly define each kind.
Answer:
xa = the number of hoses produced on machine a;
ya = 1 if machine a is used, 0 if not
Diff: 2 Page Ref: 200
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: integer program prob formulation, decision variable definition
AACSB: Analytic skills

59) Write the objective function.

Answer:
MIN Z = 1.25X1 + 1.50X2 + 1.00X3 + 2.000X4+ 750Y1 + 500Y2 +1000Y3 + 300Y4
Diff: 2 Page Ref: 200
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: integer programming problem formulation, model constraints
AACSB: Analytic skills

60) Write a constraint to ensure that if machine 4 is used and machine 1 will not be used.
Answer: y1 + y4 ≤ 1
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming problem formulation, model constraints
AACSB: Analytic skills

61) Write a constraint that will ensure that Weithoff purchases exactly two machines.
Answer: Y1 + Y2 + Y3 + Y4 = 2
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

12
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
62) Max Z = x1 + 6x2
Subject to: 17x1 + 8x2 ≤ 136
3x1 + 4x2 ≤ 36
x1, x2 ≥ 0 and integer

Find the optimal solution.

Answer: x1 = 0, x2 = 9, Z = 54
Diff: 2 Page Ref: 190-199
Section Heading: Computer Solution of Integer Program Probs w/Excel, QM for Win
Keywords: integer programming problem computer solution
AACSB: Analytic skills

63) Max Z = 3x1 + 5x2

Subject to: 7x1 + 12x2 ≤ 136
3x1 + 5x2 ≤ 36
x1, x2 ≥ 0 and integer

Find the optimal solution.

Answer: x1 = 12, x2 = 0, Z = 36
Diff: 2 Page Ref: 190-199
Section Heading: Computer Solution of Integer Program Probs w/Excel, QM for Win
Keywords: integer programming problem computer solution
AACSB: Analytic skills

13
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
64) Solve the following integer linear program graphically.

MAX Z = 5x1 + 8x2

s.t. x1 + x2 ≤ 6
5x1 + 9x2 ≤ 45
x1, x2 ≥ 0 and integer
Answer: x1 = 0, x2 = 5, Z = 40
Note that feasible space lattice points have been shaded.

Diff: 3 Page Ref: 190-199

Section Heading: Computer Solution of Integer Program Probs w/Excel, QM for Win
Keywords: integer programming graphical solution
AACSB: Analytic skills

65) You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each
site as S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, write the constraint for the first restriction.
Answer: S1 + S3 +S7 ≤ 2
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

14
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
66) You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each
site as S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, write the constraint(s) for the second restriction.
Answer: S2 + S5 ≤ 1, S4 + S5 ≤ 1
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

67) You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each
site as S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, write the constraint for the third restriction.
Answer: S1 + S2 + S3 +S4 + S5 + S6 + S7 ≥ 3
Diff: 1 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

Due to increased sales, a company is considering building three new distribution centers (DCs) to serve
four regional sales areas. The annual cost to operate DC 1 is $500 (in thousands of dollars). The cost to
operate DC 2 is $600 (in thousands of dollars.). The cost to operate DC 3 is $525 (in thousands of
dollars). Assume that the variable cost of operating at each location is the same, and therefore not a
consideration in making the location decision.

The table below shows the cost ($ per item) for shipping from each DC to each region.
Region
DC A B C D
1 1 3 3 2
2 2 4 1 3
3 3 2 2 3

The demand for region A is 70,000 units; for region B, 100,000 units; for region C, 50,000 units; and for
region D, 80,000 units. Assume that the minimum capacity for the distribution center will be 500,000
units.

15
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
68) Define the decision variables for this situation.
Answer:
y1 = 1 if DC1 is selected, 0 otherwise
y2 = 1 if DC2 is selected, 0 otherwise
y3 = 1 if DC3 is selected, 0 otherwise
x1A = quantity shipped from DC 1 to Region A
x1B = quantity shipped from DC 1 to Region B
x1C = quantity shipped from DC 1 to Region C
x1D = quantity shipped from DC 1 to Region D
x2A = quantity shipped from DC 2 to Region A
x2B = quantity shipped from DC 2 to Region B
x2C = quantity shipped from DC 2 to Region C
x2D = quantity shipped from DC 2 to Region D
x3A = quantity shipped from DC 3 to Region A
x3B = quantity shipped from DC 3 to Region B
x3C = quantity shipped from DC 3 to Region C
x3D = quantity shipped from DC 3 to Region D
Diff: 2 Page Ref: 202-203
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: facility location example, mixed integer programming
AACSB: Analytic skills

69) Write the objective function for this problem.

Answer:
Min Z = 1x1A + 3x1B + 3x1C + 2x1D + 2x2A + 4x2B + 1x2C + 3x2D + 3x3A + 2x3B + 2x3C +3x3D +
500y1 + 600y2 + 525y3
Diff: 2 Page Ref: 203
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: facility location example, mixed integer programming
AACSB: Analytic skills

70) Write the constraints for the three distribution centers.

Answer:
x1A + x1B +x1C - 500y1 ≤ 0
x2A + x2B +x2C - 500y2 ≤ 0
x3A + x3B +x3C - 500y3 ≤ 0
Diff: 2 Page Ref: 203
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: facility location example, mixed integer programming
AACSB: Analytic skills

16
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
71) Types of integer programming models are ________.
A) total
B) 0-1
C) mixed
D) all of the above
Answer: D
Diff: 1 Page Ref: 185-187
Section Heading: Integer Programming Problems
Keywords: integer programming models
AACSB: Analytic skills

72) In a ________ integer model, some solution values for decision variables are integers and others can
be non-integer.
A) total
B) 0-1
C) mixed
D) all of the above
Answer: C
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Problems
Keywords: integer programming models, mixed integer models

73) In a ________ integer model, all decision variables have integer solution values.
A) total
B) 0-1
C) mixed
D) all of the above
Answer: A
Diff: 2 Page Ref: 185
Section Heading: Integer Programming Problems
Keywords: integer programming models

74) In a ________ integer model, the solution values of the decision variables are 0 or 1.
A) total
B) 0-1
C) mixed
D) all of the above
Answer: B
Diff: 2 Page Ref: 183
Section Heading: Integer Programming Problems
Keywords: integer programming models

17
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
75) Binary variables are
A) 0 or 1 only.
B) any integer value.
C) any continuous value.
D) any negative integer value.
Answer: A
Diff: 1 Page Ref: 186
Section Heading: Computer Solution of Integer Program Probs w/Excel, QM for Win
Keywords: integer programming formulation

76) Which of the following is not an integer linear programming problem?

A) pure integer
B) mixed integer
C) 0-1 integer
D) continuous
Answer: D
Diff: 2 Page Ref: 185-187
Section Heading: Integer Programming Problems
Keywords: integer programming models

77) If the solution values of a linear program are rounded in order to obtain an integer solution, the
solution is
A) always optimal and feasible.
B) sometimes optimal and feasible.
C) always feasible.
D) never optimal and feasible.
Answer: B
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Graphical Solution
Keywords: integer programming models
AACSB: Analytic skills

78) The branch and bound method of solving linear integer programming problems is
A) an integer method.
B) a relaxation method.
C) a graphical solution.
D) an enumeration method.
Answer: D
Diff: 2 Page Ref: 190
Section Heading: Integer Programming Problems
Keywords: integer programming solution methods, branch and bound method

18
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
79) If a maximization linear programming problem consists of all less-than-or-equal-to constraints with
all positive coefficients and the objective function consists of all positive objective function coefficients,
then rounding down the linear programming optimal solution values of the decision variables will
________ result in a(n) ________ solution to the integer linear programming problem.
A) always, optimal
B) always, non-optimal
C) never, non-optimal
D) sometimes, optimal
Answer: D
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Problems
Keywords: integer programming solution, rounding off
AACSB: Analytic skills

80) If a maximization linear programming problem consists of all less-than-or-equal-to constraints with
all positive coefficients and the objective function consists of all positive objective function coefficients,
then rounding down the linear programming optimal solution values of the decision variables will
________ result in a feasible solution to the integer linear programming problem.
A) always
B) sometimes
C) optimally
D) never
Answer: A
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Problems
Keywords: integer programming solution, rounding off

81) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 ≤ 1 is a ________
constraint.
A) multiple-choice
B) mutually exclusive
C) conditional
D) corequisite
Answer: B
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Problems
Keywords: mutually exclusive constraints, 0-1 variables
AACSB: Analytic skills

19
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
The Exorbitant Course Fees. The $75 per credit hour course fee tacked on to all the MBA classes has
generated a windfall of $56,250 in its first semester. "Now we just need to make sure we spend it all,"
the Assistant Dean cackled. She charged the Graduate Curriculum Committee with generating a
shopping list before their next meeting. Four months later, the chairman of the committee distributed the
following. As the professor for the quantitative modeling course, he tended to think in terms of decision
variables, so he added the left-most column for ease of use.

Decision
Variable Item Cost Note
A iPads for everybody $750/unit Must get a cover if these are purchased
B iPad covers with MBA logo $25/unit Not needed unless we buy iPads
C Speaker series $15,000 Can't afford both this and the iPads
Subscriptions to the Wall
D Street Journal $10/unit Don't need if we have the electronic version
Subscriptions to the
electronic version of the Wall
E Street Journal $5/unit Worthless without the iPads

82) Which constraint best describes the situation with decision variables A and B?
A) B - A ≤ 0
B) B - A = 0
C) B + A = 1
D) B + A ≤ 1
Answer: B
Diff: 2 Page Ref: 185-187
Section Heading: Integer Programming Models
Keywords: 0-1 variables, multiple choice constraint
AACSB: Analytic skills

83) Which of the constraints best describes the relationship between the iPads for everyone and the
speaker series?
A) A - C ≤ 1
B) A + C = 1
C) A - C = 0
D) A + C = 2
Answer: B
Diff: 2 Page Ref: 185-187
Section Heading: Integer Programming Models
Keywords: 0-1 integer programming
AACSB: Analytic skills

20
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
84) Which of the following constraints best describes the relationship between the electronic Wall Street
Journal subscription and the iPads?
A) E - A = 0
B) E - A = 1
C) E - A ≤ 0
D) E - A ≤ 1
Answer: C
Diff: 2 Page Ref: 185-187
Section Heading: Integer Programming Models
Keywords: 0-1 variables, conditional constraints
AACSB: Analytic skills

85) Which of these formulations of the budget constraint is correct? Assume that there are 20 students in
this semesters MBA class.
A) $750A + $25B + $15,000C + $10D + $5E ≤ $56,250
B) 20A + 20B + C + 20D + 20E ≤ $56,250
C) A + B + C + D + E ≤ 20
D) $15,000A + $500B + $15,000C + $200D + $100E ≤ $56,250
Answer: D
Diff: 2 Page Ref: 185-187
Section Heading: Integer Programming Models
Keywords: integer linear programming formulation, capital budgeting
AACSB: Analytic skills

Saba conducts regular tours of his favorite city in the world, Paris. Each semester he selects among the
finest students in the university and escorts them to the City of Lights. In addition to a world-class
education on conducting business in Europe, he arranges a number of cultural outings for them to help
them immerse themselves in all that France has to offer. He collects an extra $100 from each student for
this purpose and limits his tour group to ten lucky individuals. Some of the events (and their prices) he
proposes to the students include:

Eiffel Tower visit, $40 per student, E

Paris Sewer spelunking, $20 per student, S
Half day passes to the Louvre, $60 per student, L
Bon Beret tour, $50 per student, B

So much to do and so little time!

86) Which constraint is most appropriate if the students can choose only three of these activities?
A) E + S + L + B ≤ 3
B) $40E + $20S + $60L + $50B ≤ $100
C) E + S + L + B ≥ 2
D) E + S + L + B ≤ 4
Answer: A
Diff: 2 Page Ref: 185-187
Section Heading: Integer Programming Models
Keywords: 0-1 variables, multiple choice constraint
AACSB: Analytic skills

21
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
87) If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a ________
constraint.
A) multiple-choice
B) mutually exclusive
C) conditional
D) corequisite
Answer: A
Diff: 2 Page Ref: 187
Section Heading: Integer Programming Problems
Keywords: multiple choice constraints, 0-1 variables

88) If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a ________
constraint.
A) multiple-choice
B) mutually exclusive
C) conditional
D) corequisite
Answer: C
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Problems
Keywords: conditional constraints, 0-1 variables

89) If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a ________
constraint.
A) multiple-choice
B) mutually exclusive
C) conditional
D) corequisite
Answer: D
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Problems
Keywords: corequisite constraints, 0-1 variables

90) For a maximization integer linear programming problem, a feasible solution is ensured by rounding
________ non-integer solution values if all of the constraints are the less-than-or-equal-to type.
A) up and down
B) up
C) down
D) up or down
Answer: C
Diff: 2 Page Ref: 189
Section Heading: Integer Programming Graphical Solution
Keywords: integer linear programming solution
AACSB: Analytic skills

22
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
91) In a capital budgeting problem, if either project 1 or project 2 is selected, then project 5 cannot be
selected. Which of the alternatives listed below correctly models this situation?
A) x1 + x2 + x5 ≤ 1
B) x1 + x2 + x5 ≥1
C) x1 + x5 ≤ 1, x2 + x5 ≤ 1
D) x1 - x5 ≤ 1, x2 - x5 ≤ 1
Answer: C
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

92) You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each
site as S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, the constraint for the first restriction is :
A) S1 + S3 + S7 ≥ 1
B) S1 + S3 + S7 ≤1
C) S1 + S3 + S7 = 2
D) S1 + S3 + S7 ≤ 2
Answer: D
Diff: 3 Page Ref: 202
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

23
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
Due to increased sales, a company is considering building three new distribution centers (DCs) to serve
four regional sales areas. The annual cost to operate DC 1 is $500 (in thousands of dollars). The cost to
operate DC 2 is $600 (in thousands of dollars.). The cost to operate DC 3 is $525 (in thousands of
dollars). Assume that the variable cost of operating at each location is the same, and therefore not a
consideration in making the location decision.

The table below shows the cost ($ per item) for shipping from each DC to each region.
Region
DC A B C D
1 1 3 3 2
2 2 4 1 3
3 3 2 2 3

The demand for region A is 70,000 units; for region B, 100,000 units; for region C, 50,000 units; and for
region D, 80,000 units. Assume that the minimum capacity for the distribution center will be 500,000
units.

Assume that Xij = quantity shipped from distribution i to region j. i = 1,2,3 and j = 1, 2, 3, 4.
Assume that Yi = 0 or 1 where i = distribution center 1, 2 or 3.

93) The constraint for distribution center 1 is:

A) X11 + X12 +X13 + X14 - 500y1 ≤ 0
B) X11 + X12 +X13 + X14D + 500y1 ≤ 0
C) X11 + X12 +X13 + X14 ≤ 500
D) X11 + X12 +X13 + X14 ≥ 500
Answer: A
Diff: 2 Page Ref: 183
Section Heading: Integer Programming Graphical Solution
Keywords: facility location example, mixed integer programming
AACSB: Analytic skills

24
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
94) The objective function is

A) Min Z = +

B) Min Z = +

C) Min Z = +

D) Min Z = +

Answer: A
Diff: 3 Page Ref: 202
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: facility location example, mixed integer programming
AACSB: Analytic skills

95) You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each
site as S1, S2, S3, S4, S5, S6, and S7. The restrictions are:
Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7.
Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5.
Restriction 3. Of all the sites, at least 3 should be assessed.
Assuming that Si is a binary variable, write the constraint(s) for the second restriction.
A) S2 + S5 ≤ 1
B) S4 + S5 ≤ 1
C) S2 +S5 + S4 + S5 ≤ 2
D) S2 +S5 ≤ 1, S4 + S5 ≤ 1
Answer: D
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation, constraint
AACSB: Analytic skills

25
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
Future Plastics manufactures plastic products for industrial use worldwide. In order to meet demand,
they are considering setting up a facility in each region in order to lower transportation cost and to
possibly avoid duties that could be imposed if the product is imported from another region. The
disadvantage of this approach is that plants are sized to meet local demand and may not fully exploit
economies of scale. Therefore, Future Plastics is also interested in determining the appropriate size of
the facility to build in each location and are choosing between facilities with capacities of 5 or 10
million.

The fixed costs of each facility as well as the cost of shipping between regions is shown in the table
below. The decision variables are defined as follows:
Xij = quantity shipped from supply region i to demand region j. i = 1, 2, 3, 4 and j = 1, 2, 3, 4.
Yik = 1 if facility k is selected for supply region i; 0 otherwise, where i = 1, 2, 3, 4 for each supply
region; k = 1 (low capacity facility) or 2 (high capacity facility)

Demand Region
Production and Transportation Cost
per 1,000,000 Units Low Capacity High Capacity
Supply North South South Fixed Fixed
Region America America Asia Europe Cost Capacity Cost Capacity
North
America 40 45 51 65 3,000 5 4,500 10
South
America 51 57 47 60 3,200 5 4,800 10
South Asia 58 63 45 31 2,000 5 3,000 10
Europe 71 50 51 53 1,800 5 2,700 10
Demand 6 4 7 8

96) The constraint for the North American supply region is:
A) X11 + X21 + X31 + X34 - 5Y11 - 10Y21 ≤ 0
B) X11 + X12 + X13 + X14 - 5Y11 - 10Y12 ≤ 0
C) X11 + X12 + X13 + X14 - 3200Y11 - 4800Y12 ≤ 0
D) X11 + X12 + X13 + X14 - 5Y11 - 10Y12 = 0
Answer: B
Diff: 3 Page Ref: 202
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: mixed integer linear programming problems
AACSB: Analytic skills

97) The constraint for the South Asia demand region is:
A) X31 + X32 + X33 + X34 =7
B) X31 + X32 + X33 + X34 ≤ 7
C) X13 + X23 + X33 + X43 ≤ 7
D) X13 + X23 + X33 + X43 = 7
Answer: D
Diff: 3 Page Ref: 202
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: mixed integer linear programming problems
AACSB: Analytic skills
26
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
98) Which of these constraints will ensure that either a low capacity or a high facility capacity facility is
built in the European supply region?
A) Y41 + Y42 = 1
B) Y41 + Y42 ≤ 1
C) Y14 + Y24 = 1
D) Y14 + Y24 ≤ 1
Answer: A
Diff: 3 Page Ref: 202
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: mixed integer linear programming problems
AACSB: Analytic skills

99) Which of these constraints will ensure that a low capacity facility is not built in South America?
A) Y12 + Y22 ≤ 1
B) Y12 + Y22 =1
C) Y12 + Y22 =0
D) Y21 + Y22 ≤ 1
Answer: C
Diff: 2 Page Ref: 202
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: mixed integer linear programming problems
AACSB: Analytic skills

100) Max Z = 5x1 + 6x2

Subject to: 17x1 + 8x2 ≤ 136
3x1 + 4x2 ≤ 36
x1, x2 ≥ 0 and integer
What is the optimal solution?
A) x1 = 6, x2 = 4, Z = 54
B) x1 = 3, x2 = 6, Z = 51
C) x1 = 2, x2 = 6, Z = 46
D) x1 = 4, x2 = 6, Z = 56
Answer: D
Diff: 2 Page Ref: 190-199
Section Heading: Computer Solution of Integer Program Probs w/Excel, QM for Win
Keywords: integer programming solution
AACSB: Analytic skills

27
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
101) Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and
xj = 1 if project j is selected and xj = 0, otherwise.
The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be
selected.
A) exactly 1, 2
B) exactly 2, 4
C) at least 2, 4
D) at most 1, 2
Answer: B
Diff: 2 Page Ref: 200
Section Heading: 0-1 Integer Programming Modeling Examples
Keywords: integer programming formulation, 0-1 integer programming
AACSB: Analytic skills

102) In a 0-1 integer programming model, if the constraint x1 - x2 = 0, it means when project 1 is
selected, project 2 ________ be selected.
A) can also
B) can sometimes
C) can never
D) must also
Answer: D
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation
AACSB: Analytic skills

103) In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is
selected, project 1 ________ be selected.
A) must always
B) can sometimes
C) can never
D) is already
Answer: B
Diff: 2 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: integer programming formulation
AACSB: Analytic skills

104) In formulating a mixed integer programming problem, the constraint x1 + x2 ≤ 500y1 where y1 is a
0-1 variable and x1 and x2 are continuous variables, then x1 + x2 = 500 if y1 is ________.
A) 0
B) 1
C) 0 or 1
D) none of the above
Answer: B
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Models
Keywords: mixed integer programming problem
AACSB: Analytic skills
28
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
The Wiethoff Company has a contract to produce 10,000 garden hoses for a customer. Wiethoff has four
different machines that can produce this kind of hose. Because these machines are from different
manufacturers and use differing technologies, their specifications are not the same.

105) Write a constraint to ensure that if machine 4 is used, machine 1 will not be used.
A) Y1 + Y4 ≤ 0
B) Y1 + Y4 = 0
C) Y1 + Y4 ≤ 1
D) Y1 + Y4 ≥ 1
Answer: C
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Problems
Keywords: mixed integer programming problem, constraint formulation
AACSB: Analytic skills

106) Write the constraint for machine 4.

A) Y4 = 23
B) Y4 ≤ 300
C) X4 ≤ 5000
D) X4 -300Y1 ≤ 0
Answer: C
Diff: 3 Page Ref: 186
Section Heading: Integer Programming Problems
Keywords: mixed integer programming problem, constraint formulation
AACSB: Analytic skills

107) Write the constraint the indicates they can purchase no more than three machines.
A) Y1 + Y2 + Y3+ Y4 ≤ 3
B) Y1 + Y2 + Y3+ Y4 = 3
C) Y1 + Y2 + Y3+ Y4 ≥3
D) Y1 + Y2 + Y3 = 3
Y2 + Y3+ Y4 = 3
Answer: A
Diff: 3 Page Ref: 184
Section Heading: Integer Programming Problems
Keywords: mixed integer programming problem, constraint formulation
AACSB: Analytic skills

29
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall