Professional Documents
Culture Documents
Introduction To Management Science Quantitative 13Th Edition Anderson Test Bank Full Chapter PDF
Introduction To Management Science Quantitative 13Th Edition Anderson Test Bank Full Chapter PDF
MULTIPLE CHOICE
6. The graph of a problem that requires x1 and x2 to be integer has a feasible region
a. the same as its LP relaxation.
b. of dots.
c. of horizontal stripes.
d. of vertical stripes.
ANS: B PTS: 1 TOP: Graphical solution
9. Let x1 and x2 be 0 - 1 variables whose values indicate whether projects 1 and 2 are not done or are
done. Which answer below indicates that project 2 can be done only if project 1 is done?
a. x1 + x2 = 1
b. x1 + x2 = 2
c. x1 − x2 0
d. x1 − x2 0
ANS: D PTS: 1 TOP: Conditional and corequisite constraints
10. Let x1 , x2 , and x3 be 0 - 1 variables whose values indicate whether the projects are not done (0) or are
done (1). Which answer below indicates that at least two of the projects must be done?
a. x1 + x2 + x3 2
b. x1 + x2 + x3 2
c. x1 + x2 + x3 = 2
d. x1 − x2 = 0
ANS: A PTS: 1 TOP: k out of n alternatives constraint
11. If the acceptance of project A is conditional on the acceptance of project B, and vice versa, the
appropriate constraint to use is a
a. multiple-choice constraint.
b. k out of n alternatives constraint.
c. mutually exclusive constraint.
d. corequisite constraint.
ANS: D PTS: 1
TOP: Modeling flexibility provided by 0-1 integer variables
TRUE/FALSE
1. The LP Relaxation contains the objective function and constraints of the IP problem, but drops all
integer restrictions.
2. In general, rounding large values of decision variables to the nearest integer value causes fewer
problems than rounding small values.
3. The solution to the LP Relaxation of a minimization problem will always be less than or equal to the
value of the integer program minimization problem.
4. If the optimal solution to the LP relaxation problem is integer, it is the optimal solution to the integer
linear program.
5. Slack and surplus variables are not useful in integer linear programs.
7. In a model involving fixed costs, the 0 - 1 variable guarantees that the capacity is not available unless
the cost has been incurred.
9. The constraint x1 + x2 + x3 + x4 2 means that two out of the first four projects must be selected.
10. The constraint x1 − x2 = 0 implies that if project 1 is selected, project 2 cannot be.
11. The product design and market share optimization problem presented in the textbook is formulated as
a 0-1 integer linear programming model.
ANS: T PTS: 1
TOP: Product design and market share optimization problem
12. The objective of the product design and market share optimization problem presented in the textbook
is to choose the levels of each product attribute that will maximize the number of sampled customers
preferring the brand in question.
ANS: T PTS: 1
TOP: Product design and market share optimization problem
13. If a problem has only less-than-or-equal-to constraints with positive coefficients for the variables,
rounding down will always provide a feasible integer solution.
14. Dual prices cannot be used for integer programming sensitivity analysis because they are designed for
linear programs.
15. Some linear programming problems have a special structure that guarantees the variables will have
integer values.
16. Generally, the optimal solution to an integer linear program is less sensitive to the constraint
coefficients than is a linear program.
17. The classic assignment problem can be modeled as a 0-1 integer program.
SHORT ANSWER
1. The use of integer variables creates additional restrictions but provides additional flexibility. Explain.
ANS:
Answer not provided.
ANS:
Answer not provided.
3. Give a verbal interpretation of each of these constraints in the context of a capital budgeting problem.
a. x1 − x2 0
b. x1 − x2 = 0
c. x1 + x2 + x3 2
ANS:
Answer not provided.
4. Explain how integer and 0-1 variables can be used in an objective function to minimize the sum of
fixed and variable costs for production on two machines.
ANS:
Answer not provided.
5. Explain how integer and 0-1 variables can be used in a constraint to enable production.
ANS:
Answer not provided.
PROBLEM
1. Solve the following problem graphically.
Max 5X + 6Y
a. Graph the constraints for this problem. Indicate all feasible solutions.
b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer
solution. Is this solution optimal?
c. Find the optimal solution.
ANS:
a. The feasible region is those integer values in the space labeled feasible region.
Max X + 2Y
s.t. 6X + 8Y 48
7X + 5Y 35
X, Y 0
Y integer
a. Graph the constraints for this problem. Indicate all feasible solutions.
b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer
solution. Is this solution optimal?
c. Find the optimal solution.
ANS:
a. The feasible region consists of the portions of the horizontal lines that lie within the area
labeled F. R.
b. The optimal relaxed solution is at X = 1.538, Y = 4.846 where Z = 11.231. The rounded
solution is X = 1.538, Y = 4.
c. The optimal solution is at X = 2.667, Y = 4, Z = 10.667.
Min 6X + 11Y
s.t. 9X + 3Y 27
7X + 6Y 42
4X + 8Y 32
X, Y 0 and integer
a. Graph the constraints for this problem. Indicate all feasible solutions.
b. Find the optimal solution to the LP Relaxation. Round up to find a feasible integer
solution. Is this solution optimal?
c. Find the optimal solution.
ANS:
a. The feasible region is the set of integer points in the area labeled feasible region.
b. The optimal relaxed solution is at X = 4.5, Y = 1.75, and Z = 46.25.
The rounded solution is X = 5, Y = 2.
c. The optimal solution is at X = 6, Y = 1, and Z = 47.
4. Consider a capital budgeting example with five projects from which to select. Let xi = 1 if project i is
selected, 0 if not, for i = 1,...,5. Write the appropriate constraint(s) for each condition. Conditions are
independent.
a. Choose no fewer than three projects.
b. If project 3 is chosen, project 4 must be chosen.
c. If project 1 is chosen, project 5 must not be chosen.
d. Projects cost 100, 200, 150, 75, and 300 respectively. The budget is 450.
e. No more than two of projects 1, 2, and 3 can be chosen.
ANS:
a. x1 + x2 + x3 + x4 + x5 3
b. x3 − x4 0
c. x1 + x5 1
d. 100x1 + 200x2 + 150x3 + 75x4 + 300x5 450
e. x1 + x2 + x3 2
5. Grush Consulting has five projects to consider. Each will require time in the next two quarters
according to the table below.
ANS:
Let A = 1 if project A is selected, 0 otherwise; same for B, C, D, and E
s.t. 5A + 3B + 7C + 2D + 15E 25
8A + 12B + 5C + 3D + 1E 20
C+D1
6. The Westfall Company has a contract to produce 10,000 garden hoses for a large discount chain.
Westfall 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.
a. This problem requires two different kinds of decision variables. Clearly define each kind.
b. The company wants to minimize total cost. Give the objective function.
c. Give the constraints for the problem.
d. Write a constraint to ensure that if machine 4 is used, machine 1 cannot be.
ANS:
7. Hansen Controls has been awarded a contract for a large number of control panels. To meet this
demand, it will use its existing plants in San Diego and Houston, and consider new plants in Tulsa, St.
Louis, and Portland. Finished control panels are to be shipped to Seattle, Denver, and Kansas City.
Pertinent information is given in the table.
Develop a model whose solution would reveal which plants to build and the optimal shipping
schedule.
ANS:
Min 350000B3 + 200000B4 + 480000B5 + 5P11 + 7P12 + 8P13 + 10P21 + 8P22 + 6P23
+ 9P31 + 4P32 + 3P33 + 12P41 + 6P42 + 2P43 + 4P51 + 10P52 + 11P53
8. Simplon Manufacturing must decide on the processes to use to produce 1650 units. If machine 1 is
used, its production will be between 300 and 1500 units. Machine 2 and/or machine 3 can be used only
if machine 1's production is at least 1000 units. Machine 4 can be used with no restrictions.
(HINT: Use an additional 0 - 1 variable to indicate when machines 2 and 3 can be used.)
ANS:
s.t. U1 300S1
U1 1500S1
U1 1000K
S2 K
S3 K
U2 500S2
U2 1200S2
U3 100S3
U3 800S3
U4 1650S4
U1 + U 2 + U3 + U4 = 1650
9. Your express package courier company is drawing up new zones for the location of drop boxes for
customers. The city has been divided into the seven zones shown below. You have targeted six
possible locations for drop boxes. The list of which drop boxes could be reached easily from each zone
is listed below.
Let xi = 1 if drop box location i is used, 0 otherwise. Develop a model to provide the smallest number
of locations yet make sure that each zone is covered by at least two boxes.
ANS:
Min xi
s.t. x1 + x2 + x5 + x6 2
x2 + x4 + x5 2
x1 + x2 + x4 + x6 2
x3 + x4 + x5 2
x1 + x 2 + x5 2
x3 + x4 2
x1 + x2 + x6 2
10. Consider the problem faced by a summer camp recreation director who is trying to choose activities
for a rainy day. Information about possible choices is given in the table below.
a. Give a general definition of the variables necessary in this problem so that each activity
can be considered for inclusion in the day's schedule.
b. The popularity ratings are defined so that 1 is the most popular. If the objective is to keep
the campers happy, what should the objective function be?
ANS:
11. Tower Engineering Corporation is considering undertaking several proposed projects for the next
fiscal year. The projects, the number of engineers and the number of support personnel required for
each project, and the expected profits for each project are summarized in the following table:
Project
1 2 3 4 5 6
Engineers Required 20 55 47 38 90 63
Support Personnel Required 15 45 50 40 70 70
Profit ($1,000,000s) 1.0 1.8 2.0 1.5 3.6 2.2
Formulate an integer program that maximizes Tower's profit subject to the following management
constraints:
1) Use no more than 175 engineers
2) Use no more than 150 support personnel
3) If either project 6 or project 4 is done, both must be done
4) Project 2 can be done only if project 1 is done
5) If project 5 is done, project 3 must not be done and vice versa
6) No more than three projects are to be done.
ANS:
Max P1 + 1.8P2 + 2P3 + 1.5P4 + 3.6P5 + 2.2P6
s.t. 3x1 + x2 9
x1 + 3x2 7
−x1 + x2 1
x1, x2 0 and integer
a Solve the problem as a linear program ignoring the integer constraints. Show that the
optimal solution to the linear program gives fractional values for both x1 and x2.
b. What is the solution obtained by rounding fractions greater than of equal to 1/2 to the next
larger number? Show that this solution is not a feasible solution.
c. What is the solution obtained by rounding down all fractions? Is it feasible?
d. Enumerate all points in the linear programming feasible region in which both x1 and x2 are
integers, and show that the feasible solution obtained in (c) is not optimal and that in fact
the optimal integer is not obtained by any form of rounding.
ANS:
a. From the graph on the next page, the optimal solution to the linear program is x1 = 2.5,
x2 = 1.5, z = 10.5.
b. By rounding the optimal solution of x1 = 2.5, x2 = 1.5 to x1 = 3, x2 = 2, this point lies
outside the feasible region.
c. By rounding the optimal solution down to x1 = 2, x2 = 1, we see that this solution indeed is
an integer solution within the feasible region, and substituting in the objective function, it
gives z = 8.
d. There are eight feasible integer solutions in the linear programming feasible region with z
values as follows:
x1 x2 z
1. 0 0 0
2. 1 0 3
3. 2 0 6
4. 3 0 9 optimal
5. 0 1 2
6. 1 1 5
7. 2 1 8 part (c) solution
8. 1 2 7
x1 = 3, x2 = 0 is the optimal solution. Rounding the LP solution (x1 = 2.5, x2 = 1.5) would
not have been optimal.
13. Tom's Tailoring has five idle tailors and four custom garments to make. The estimated time (in hours)
it would take each tailor to make each garment is listed below. (An 'X' in the table indicates an
unacceptable tailor-garment assignment.)
Tailor
Garment 1 2 3 4 5
Wedding gown 19 23 20 21 18
Clown costume 11 14 X 12 10
Admiral's uniform 12 8 11 X 9
Bullfighter's outfit X 20 20 18 21
Formulate and solve an integer program for determining the tailor-garment assignments that minimize
the total estimated time spent making the four garments. No tailor is to be assigned more than one
garment and each garment is to be worked on by only one tailor.
ANS:
Define the decision variables:
xij = 1 if garment i is assigned to tailor j; = 0 otherwise.
Number of decision variables = [(number of garments)(number of tailors)]
− (number of unacceptable assignments) = [4(5)] − 3 = 17.
Define the objective function:
Minimize total time spent making garments:
MIN 19x11 + 23x12 + 20x13 + 21x14 + 18x15 + 11x21 + 14x22 + 12x24 + 10x25
+ 12x31 + 8x32 + 11x33 + 9x35 + 20x42 + 20x43 + 18x44 + 21x45
Define the constraints:
Exactly one tailor per garment: No more than one garment per tailor:
1) x11 + x12 + x13 + x14 + x15 = 1 5) x11 + x21 + x31 1
2) x21 + x22 + x 24 + x25 = 1 6) x12 + x22 + x32 + x42 1
3) x31 + x32 + x33 + x35 = 1 7) x13 + x33 + x43 1
4) x42 + x43 + x44 + x45 = 1 8) x14 + x24 + x44 1
9) x15 + x25 + x35 + x45 1
Nonnegativity: xij 0 for i = 1,..,4 and j = 1,..,5
Optimal Solution:
Assign wedding gown to tailor 5
Assign clown costume to tailor 1
Assign admiral uniform to tailor 2
Assign bullfighter outfit to tailor 4
Total time spent = 55 hours
14. Market Pulse Research has conducted a study for Lucas Furniture on some designs for a new
commercial office desk. Three attributes were found to be most influential in determining which desk
is most desirable: number of file drawers, the presence or absence of pullout writing boards, and
simulated wood or solid color finish. Listed below are the part-worths for each level of each attribute
provided by a sample of 7 potential Lucas customers.
Suppose the overall utility (sum of part-worths) of the current favorite commercial office desk is 50 for
each customer. What is the product design that will maximize the share of choices for the seven
sample participants? Formulate and solve, using Lindo or Excel, this 0 - 1 integer programming
problem.
ANS:
Define the decision variables:
There are 7 lij decision variables, one for each level of attribute.
lij = 1 if Lucas chooses level i for attribute j; 0 otherwise.
There are 7 Yk decision variables, one for each consumer in the sample.
Yk = 1 if consumer k chooses the Lucas brand, 0 otherwise.
Define the objective function:
Maximize the number of consumers preferring the Lucas brand desk.
MAX Y1 + Y2 + Y3 + Y4 + Y5 + Y6 + Y7
Define the constraints:
There is one constraint for each consumer in the sample.
5l11 + 26l21 + 20l31 + 18l12 + 11l22 + 17l13 + 10l23 − 50Y1 1
18l11 + 11l21 + 5l31 + 12l12 + 16l22 + 15l13 + 26l23 − 50Y2 1
4l11 + 16l21 + 22l31 + 7l12 + 13l22 + 11l13 + 19l23 − 50Y3 1
12l11 + 8l21 + 4l31 + 18l12 + 9l22 + 22l13 + 14l23 − 50Y4 1
19l11 + 9l21 + 3l31 + 4l12 + 14l22 + 30l13 + 19l23 − 50Y5 1
6l11 + 15l21 + 21l31 + 8l12 + 17l22 + 20l13 + 11l23 − 50Y6 1
9l11 + 6l21 + 3l31 + 13l12 + 5l22 + 16l13 + 28l23 − 50Y7 1
There is one constraint for each attribute.
l11 + l21 + l31 = 1
l12 + l22 = 1
l13 + l23 = 1
Optimal Solution:
Lucas should choose these product features:
Participant 1 (Y1 = 1)
Participant 5 (Y5 = 1)
Participant 6 (Y6 = 1)
15. Kloos Industries has projected the availability of capital over each of the next three years to be
$850,000, $1,000,000, and $1,200,000, respectively. It is considering four options for the disposition
of the capital:
(1) Research and development of a promising new product
(2) Plant expansion
(3) Modernization of its current facilities
(4) Investment in a valuable piece of nearby real estate
Monies not invested in these projects in a given year will NOT be available for following year's
investment in the projects. The expected benefits three years hence from each of the four projects and
the yearly capital outlays of the four options are summarized in the table below in $1,000,000's.
In addition, Kloos has decided to undertake exactly two of the projects, and if plant expansion is
selected, it will also modernize its current facilities.
ANS:
Language: Finnish
Kirj.
I.
Eräänä sunnuntai-aamuna syyspuoleen vuotta oli tavallista
enemmän kirkkolaisia kokoontunut Myllymäen matamin tupaan, joka
vähän matkaa kirkosta oli mäen rinteellä. Matamin kahvipannu
kiehua porisi liedellä, valmistaen mieluista juomaa saapuneille
vieraille, joista toiset istuivat, mutta jokunen vielä seisoi. Oikeastaan
oli matamilla kaksi pannua, toinen suurempi, josta kaadettiin
tavallisille vieraille, ja oli useimmiten heti valmiina ja toinen pienempi,
jonka herkusta vaan paremmat pääsivät osallisiksi. Nyt oli se
pienempi pannu joka oli tulella, josta voi päättää, että vieraat
kuuluivat parempaan luokkaan matamin kirjoissa.
Niinkö se isäntä sen asian tuumii, vaikka kyllä minä olen kuullut,
että moni muu on samoin tuuminut. Ja kun se siksi tulee, niin pian se
maisteri on sen kirkkoherran tutkinnon lukenut, selitti matami, joka
hyvin tunsi maisterin suuren kyvyn.
Eipä ihme, jos Juorulan vanha piika oli valmis kenelle hyvänsä
vakuuttamaan, »ettei sellaista pappia, kuin maisteri oli, ollut koko
Suomenmaassa». Ulkomaiden oloja ei hän vielä lähemmin tuntenut,
sillä hän ollut matkustanut juuri ulkopuolella lavean Kettuniemen
rajoja. Muuten olisi hänen vertausalansa tullut ehkä hieman
laveammaksi.