ISM: Introductory Mathematical Analysis Section 7.

x1 x2 s1 s2 s3 t3 W
s1 ⎡ – 3 0 0 ⎤ 0
1 1 0 2 – 23 0
⎢ 3 ⎥
s2 ⎢ 0 0 0 1 1 –1 0 200 ⎥ 200
⎢ ⎥
x2 ⎢ 32 1 0 0 – 13 1 0 100 ⎥
⎢ 3
⎥
W ⎢ – 20 0 0 0 – 50 50 +M 1 5000⎥
⎣ 3 3 3 ⎦
x1 x2 s1 s2 s3 P
s3 ⎡ – 2 0 2 0 1 0 0 ⎤
1 3
⎢ ⎥
s2 ⎢ 1 0 − 3 1 0 0 200 ⎥ 400
⎢ 2 2 ⎥
x2 ⎢ 1 1 1 0 0 0 100 ⎥ 200
⎢ 2 2 ⎥
P ⎢ –15 0 25 0 0 1 5000⎥
⎣ ⎦
x1 x2 s1 s2 s3 P
s3 ⎡0 1 2 0 1 0 100⎤
⎢ ⎥
s2 ⎢0 −1 −2 1 0 0 100⎥
x1 ⎢ 1 2 1 0 0 0 200⎥
⎢ ⎥
P ⎢⎣0 30 40 0 0 1 8000⎦⎥
The table indicates that, to maximize profit, the company should produce 200 standard and 0 executive desks.

14. Let x, y and z denote the numbers of units of products X, Y, and Z produced each week, respectively. We want to
maximize the profit function P = 50x + 60y + 75z subject to
x + 2 y + 2 z ≤ 40,
x + y + 2 z ≤ 30,
z ≥ 5,
x, y, z ≥ 0.
The artificial objective function is W = P – Mt3 .
x y z s1 s2 s3 W t3
⎡ 1 2 2 1 0 0 0 40 ⎤
0
⎢ 1 1 2 0 1 0 0 30 ⎥⎥
0
⎢
⎢ 0 0 1 0 0 –1 0 5⎥1
⎢ ⎥
⎢⎣ –50 –60 –75 0 0 0 M 1 0⎥
⎦
x y z s1 s2 s3 t3 W
s1 ⎡ 1 2 2 1 0 0 0 0 40 ⎤ 20
⎢ 1 1 2 0 1 0 0 0 30 ⎥⎥ 15
s2 ⎢
t3 ⎢ 0 0 1 0 0 –1 1 0 5 ⎥ 5
⎢ ⎥
W ⎢⎣ –50 –60 –75 – M 0 0 M 0 1 –5M ⎥
⎦
x y z s1 s2 s3 t3 W
s1 ⎡ 1 2 0 1 0 2 –2 0 30 ⎤ 15
⎢ 1 1 0 0 1 2 –2 0 20 ⎥⎥ 10
s2 ⎢
z ⎢ 0 0 1 0 0 –1 1 0 5 ⎥
⎢ ⎥
W ⎢⎣ –50 –60 0 0 0 –75 75 + M 1 375⎥
⎦

269
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

x y z s1 s2 s3 P
⎡ 0 1 0 1 –1 0 0 10 ⎤ 10
s1 ⎢ ⎥
1 1 0 0 12 1 0 10 ⎥ 20
s3 ⎢ 2 2
⎢ 1 1 ⎥
z⎢ 2 2
1 0 12 0 0 15 ⎥ 30
P ⎢⎢ – 25 – 45 0 0 75 0 1 1125⎥⎥
⎣ 2 2 2 ⎦
x y z s1 s2 s3 P
y⎡ 0 1 0 1 –1 0 0 10 ⎤
⎢ 1 ⎥
s3 ⎢ 2 0 0 – 12 1 1 0 5 ⎥ 10
⎢ ⎥
z⎢ 1 0 1 – 1 1 0 0 10 ⎥ 20
⎢ 2 2
⎥
P ⎢ – 2 0 0 2 15 0 1 1350 ⎥
25 45
⎣ ⎦
x y z s1 s2 s3 P
y ⎡0 1 0 1 –1 0 0 10 ⎤
⎢ 1 0 0 –1 2 2 0 10 ⎥⎥
x⎢
z ⎢0 0 1 0 0 –1 0 5⎥
⎢ ⎥
P ⎢⎣0 0 0 10 40 25 1 1475⎦⎥
The production order should be 10 units of X, 10 units of Y, and 5 units of Z for a maximum profit of $1475

15. Suppose I is the total investment. Let x1 , x2 , and x3 be the proportions invested in A, AA, and AAA bonds,
respectively. If Z is the total annual yield expressed as a proportion of I, then ZI = 0.08 x1I + 0.07 x2 I + 0.06 x3 I ,
or equivalently, Z = 0.08 x1 + 0.07 x2 + 0.06 x3 . We want to maximize Z subject to
x1 + x2 + x3 = 1,
x2 + x3 ≥ 0.50,
x1 + x2 ≤ 0.30,
x1 , x2 , x3 ≥ 0.
The artificial objective function is W = Z – Mt1 – Mt2 .
x1 x2 x3 s2 s3 t1 t2 W
⎡ 1 1 1 0 0 1 0 0 1 ⎤
⎢ 0 1 1 –1 0 0 1 0 0.5⎥⎥
⎢
⎢ 1 1 0 0 1 0 0 0 0.3⎥
⎢ ⎥
⎢⎣ –0.08 –0.07 –0.06 0 0 M M 1 0 ⎦⎥
x1 x2 x3 s2 s3 t1 t2 W
t1 ⎡ 1 1 1 0 0 1 0 0 1 ⎤ 1
⎢ 0 1 1 –1 0 0 1 0 0.5 ⎥⎥ 0.5
t2 ⎢
s3 ⎢ 1 1 0 0 1 0 0 0 0.3 ⎥ 0.3
⎢ ⎥
W ⎢⎣ –0.08 – M –0.07 – 2 M –0.06 – 2 M M 0 0 0 1 –1.5M ⎥
⎦

270
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.7

x1 x2 x3 s2 s3 t1 t2 W
t1 ⎡ 0 0 1 0 –1 1 0 0 0.7 ⎤ 0.7
⎢ –1 0 1 –1 –1 0 1 0 0.2 ⎥
t2 ⎢ ⎥ 0.2
x2 ⎢ 1 1 0 0 1 0 0 0 0.3 ⎥
⎢ ⎥
W ⎢⎣ –0.01 + M 0 –0.06 – 2M M 0.07 + 2 M 0 0 1 0.021 – 0.9M ⎥
⎦
x1 x2 x3 s2 s3 t1 t2 W
t1 ⎡ 1 0 0 1 0 1 –1 0 0.5 ⎤ 0.5
⎢ –1 0 1 –1 –1 0 1 0 0.2 ⎥
x3 ⎢ ⎥
x2 ⎢ 1 1 0 0 1 0 0 0 0.3 ⎥ 0.3
⎢ ⎥
W ⎢⎣ –0.07 – M 0 0 –0.06 – M 0.01 0 0.06 + 2 M 1 0.033 – 0.5M ⎥
⎦
x1 x2 x3 s2 s3 t1 t2 W
t1 ⎡ 0 –1 0 1 –1 1 –1 0 0.2 ⎤ 0.2
⎢ ⎥
x3 ⎢ 0 1 1 –1 0 0 1 0 0.5 ⎥
x1 ⎢1 1 0 0 1 0 0 0 0.3 ⎥
⎢ ⎥
W ⎢⎣ 0 0.07 + M 0 –0.06 – M 0.08 + M 0 0.06 + 2 M 1 0.054 – 0.2 M ⎥
⎦
x1 x2 x3 s2 s3 t1 t2 W
s2 ⎡ 0 –1 0 1 –1 1 –1 0 0.2 ⎤
⎢0 0 1 0 –1 1 0 0 0.7 ⎥⎥
x3 ⎢
x1 ⎢ 1 1 0 0 1 0 0 0 0.3⎥
⎢ ⎥
W ⎢⎣ 0 0.01 0 0 0.02 0.06 + M M 1 0.066 ⎥⎦
For the above table, t1 = t2 = 0. Thus W = Z.
The fund should put 30% in A bonds, 0% in AA, and 70% in AAA for a yield of 6.6%.

Problems 7.7

x1 x2 s1 s2 t1 t2 W
1. ⎡
1 −1 –1 0 1 0 0 7⎤
⎢ ⎥
⎢ 2 1 0 –1 0 1 0 9⎥
⎢2 5 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W
t1 ⎡ 1 −1 –1 0 1 0 0 ⎤7 7
⎢ ⎥
t2 ⎢ 2 1 0 –1 0 1 0 ⎥ 92
9
⎢ ⎥
W ⎢⎣ 2 − 3M 5 M M 0 0 1 –16M ⎥
⎦
x1 x2 s1 s2 t1 t2 W
t1 ⎡ 0 −23 –1 1 1 − 12 0 5 ⎤5
⎢ 2 2 ⎥
⎢
x1 ⎢1 1 0 – 12 0 1 0 9 ⎥
2 2 2 ⎥
W ⎢⎢ 0 4 + 3 M M 1 − 1 M 0 −1 + 32 M
⎥
1 –9 − 52 M ⎥
⎣ 2 2 ⎦

271
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

x1 x2 s1 s2 t1 t2 W
⎡
s2 0 −3 –2 1 2 −1 0 5⎤
⎢ ⎥
x1 ⎢ 1 −1 −1 0 1 0 0 7⎥
⎢
W 0 7 2 0 –2 + M M 1 –14 ⎥
⎣ ⎦
The minimum is Z = 14 when x1 = 7, x2 = 0.

x1 x2 s1 s2 t1 t2 W
2.
⎡ 1 2 –1 0 1 0 0 4⎤
⎢ ⎥
⎢ 2 1 0 –1 0 1 0 4⎥
⎢4 3 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W
t1 ⎡ 1 2 –1 0 1 0 0 4 ⎤2
⎢ ⎥
t2 ⎢ 2 1 0 –1 0 1 0 4 ⎥4
W ⎢ 4 − 3M 3 − 3M M M 0 0 1 –8M ⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W
x2 ⎡⎢ 1 1 – 12 0 1 0 0 2
⎤
⎥4
2 2
⎢ 3 1 ⎥4
t2 ⎢ 2 0 2
–1 – 12 1 0 2 ⎥3
⎢ ⎥
W ⎢ 5 − 3 M 0 3 − 1 M M − 3 + 3 M 0 1 –6 – 2M ⎥
⎣2 2 2 2 2 2 ⎦
x1 x2 s1 s2 t1 t2 W
⎡
x2 0 1 − 2 1 2 − 13 0 4⎤
⎢ 3 3 3 3⎥
x1 ⎢⎢ 1 0 1 –2
3 3
– 1
3
2 0
3
4⎥
3⎥
⎢ ⎥
W ⎢0 0 7 5 −3 +M –3+M 1 – 3 ⎥
2 5 28
⎣ 6 3 ⎦
28 4
The minimum is Z = when x1 = x2 = .
3 3

x1 x2 x3 s t W
3.
⎡ 1 –1 –1 –1 1 0 18⎤
⎢12 6 3 0 M 1 0⎥
⎢⎣ ⎦⎥
x1 x2 x3 s t W
t ⎡ 1 –1 –1 –1 1 0 18 ⎤ 18
⎢12 – M 6 + M 3 + M M 0 1 –18M ⎥
W ⎢⎣ ⎦⎥
x1 x2 x3 s t W
x1 ⎡ 1 –1 –1 –1 1 0 18⎤
⎢ 0 18 15 12 –12 + M 1 –216⎥
W ⎢⎣ ⎦⎥
The minimum is Z = 216 when x1 = 18, x2 = 0, x3 = 0 .

272
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.7

x1 x2 x3 s t W
4. ⎡1 2 –1 –1 1 0 4 ⎤
⎢1 1 2 0 M 1 0 ⎥
⎢⎣ ⎦⎥
x1 x2 x3 s t W
t ⎡ 1 2 –1 –1 1 0 4 ⎤2
⎢1 – M 1 – 2 M 2 + M M 0 1 –4M ⎥
W ⎢⎣ ⎥⎦
x2 ⎡ 1 1 – 1 – 1 1 0 2⎤
⎢2 2 2 2 ⎥
⎢1 0 5 1 – 1 + M 1 –2 ⎥
W ⎢⎣ 2 2 2 2 ⎥⎦
The minimum is Z = 2 when x1 = 0, x2 = 2, x3 = 0 .

5. We write the second constraint as – x1 + x3 ≥ 4.

x1 x2 x3 s1 s2 s3 t2 W
⎡ 1 1 1 1 0 0 0 0 6⎤
⎢ –1 0 1 0 –1 0 1 0 4 ⎥⎥
⎢
⎢ 0 1 1 0 0 1 0 0 5⎥
⎢ ⎥
⎢⎣ 2 3 1 0 0 0 M 1 0 ⎥⎦
x1 x2 x3 s1 s2 s3 t2 W
s1 ⎡ 1 1 1 1 0 0 0 0 6 ⎤6
⎢ –1 0 1 0 –1 0 1 0 4 ⎥⎥ 4
t2 ⎢
s3 ⎢ 0 1 1 0 0 1 0 0 5 ⎥5
⎢ ⎥
W ⎣⎢ 2 + M 3 1 – M 0 M 0 0 1 –4M ⎦⎥
x1 x2 x3 s1 s2 s3 t2 W
s1 ⎡ 2 1 0 1 1 0 2⎤
–1 0
⎢ 4 ⎥⎥
x3 ⎢ –1 0 1 0 –1 0 1 0
s3 ⎢ 1 1 0 0 1 1 –1 0 1⎥
⎢ ⎥
W ⎣⎢ 3 3 0 0 1 0 –1 + M 1 –4 ⎥
⎦
The minimum is Z = 4 when x1 = 0, x2 = 0, x3 = 4 .

x1 x2 x3 s1 s2 s3
t3 W
6.
⎡3 1 −1 1 0 0 0 4⎤
0
⎢0 2 2 0 1 0 0 0 5⎥⎥
⎢
⎢1 1 1 0 0 −1 1 0 2 ⎥
⎢ ⎥
5 1 3 0 0 0 M 1 0⎥
⎣⎢ ⎦
x1 x2 x3 s1 s2 s3 t3 W
s1 ⎡ 3 1 −1 1 0 0 0 0 4⎤ 4
⎢ 0 2 2 0 1 0 0 0 5⎥⎥ 52
s2 ⎢
t3 ⎢ 1 1 1 0 0 −1 1 0 2⎥ 2
⎢ ⎥
W ⎢⎣ 5 − M 1 − M 3 − M 0 0 M 0 1 −2 M ⎥
⎦

273
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

x1 x2 x3 s1 s2 s3 t3 W
s1 ⎡ 2 0 −2 1 0 1 2⎤−1 0
⎢ 1⎥⎥
s2 ⎢ −2 0 0 0 1 2 −2 0
x2 ⎢ 1 1 1 0 0 −1 1 0 2⎥
⎢ ⎥
W ⎣⎢ 4 0 2 0 0 1 −1 + M 1 −2 ⎥
⎦
The minimum is Z = 2 when x1 = 0, x2 = 2, and x3 = 0.

x1 x2 x3 s3 t1 t2 W
7.
⎡ 2 1 1 0 1 0 0 4⎤
⎢ 1 1 0 0 0 1 0 1⎥⎥
⎢
⎢ 1 0 1 1 0 0 0 6⎥
⎢ ⎥
−1 –3 1 0 M M 1 0⎥
⎣⎢ ⎦
x1 x2 x3 s3 t1 t2 W
t1 ⎡ 2 1 1 0 1 0 0 4 ⎤2
t2 ⎢ 1 1 0 0 0 1 0 1 ⎥⎥ 1
⎢
s3 ⎢ 1 0 1 1 0 0 0 6 ⎥6
⎢ ⎥
W ⎢ −1 − 3M –3 − 2M 1 − M 0 0 0 1 –5M ⎥
⎣ ⎦
x1 x2 x3 s3 t1 t2 W
t1 ⎡ 0 −1 1 0 1 –2 0 2 ⎤2
⎢ ⎥
x1 ⎢1 1 0 0 0 1 0 1 ⎥
s3 ⎢ 0 −1 1 1 0 –1 0 5 ⎥5
⎢ ⎥
W ⎢ 0 −2 + M 1 − M 0 0 1 + 3 M 1 1 – 2 M ⎥
⎣ ⎦
x1 x2 x3 s3 t1 t2 W
x3 ⎡ 0 −1 1 0 1 –2 0 2⎤
x1 ⎢1 1 0 0 0 1 0 1 ⎥⎥ 1
⎢
s3 ⎢ 0 0 0 1 –1 1 0 3⎥
⎢ ⎥
W ⎢ 0 −1 0 0 –1 + M 3 + M 0 –1⎥
⎣ ⎦
x1 x2 x3 s3 – Z
x3 ⎡ 1 0 1 0 0 3⎤
⎢ ⎥
x2 ⎢ 1 1 0 0 0 1⎥
s3 ⎢0 0 0 1 0 3⎥
⎢ ⎥
– Z ⎢⎣ 1 0 0 0 0 0 ⎥⎦
The minimum is Z = 0 when x1 = 0, x2 = 1, x3 = 3.

274
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.7

8. x1 x2 s1 t1 t2 W
⎡ −1 1 −1 1 0 0 4⎤
⎢ ⎥
⎢1 1 0 0 1 0 1⎥
⎢ 1 −1 0 M M 1 0⎥
⎣ ⎦
x1 x2 s1 t1 t2 W

t1⎡ −1 1 −1 1 0 0 4 ⎤4
⎢ ⎥
t2⎢1 1 0 0 1 0 1 ⎥1
⎢ ⎥
W ⎢ 1 −1 − 2M M 0 0 1 −5M ⎥
⎣ ⎦
x1 x2 s1 t1 t2 W
t1 ⎡ −2 0 −1 1 −1 0 3 ⎤
⎢ ⎥
x2 ⎢ 1 1 0 0 1 0 1 ⎥
⎢ ⎥
W ⎣ 2 + 2 M 0 M 0 1 + 2 M 1 1 − 3M ⎦
Since all of the indicators in the last table are positive, but the artificial variable t1 is 3, the feasible region is
empty. (This can also be seen graphically.)

9. x1 x2 x3 s1 s2 t1 t2 W
⎡ 1 1 1 –1 0 1 0 0 8⎤
⎢ ⎥
⎢ –1 2 1 0 –1 0 1 0 2⎥
⎢ 1 8 5 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 t2 W
t1 ⎡ 1 1 1 –1 0 1 0 0 8 ⎤8
⎢ ⎥
t2 ⎢ –1 2 1 0 –1 0 1 0 2 ⎥1
⎢
W 1 8 – 3M 5 – 2M M M 0 0 1 –10 M ⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 t2 W
t1 ⎡ 3 0 1 –1 1 1 – 12 0 7 ⎤ 14
⎢ 2 2 2 ⎥ 3
x2 ⎢⎢ – 12 1 1
2
0 – 12 0 1
2
0 1 ⎥
⎥
W ⎢5 – 3 M 0 1 – 1 M M 4 – 1 M 0 –4 + 3 M ⎥
1 –8 – 7 M ⎥
⎢⎣ 2 2 2 2 ⎦
x1 x2 x3 s1 s2 t1 t2 W
x1 ⎡ 1 ⎤
⎢1 0 3 – 32 1
3
2
3
– 13 0 14
3⎥ 14
⎢ 10⎥
x2 ⎢ 0 1 23 – 13 – 13 1
3
1
3
0 3⎥5
⎢ ⎥
W ⎢⎣ 0 0 – 3 +M – 73 + M ⎥
2 10 7 – 10 1 – 94
3 3 3 3 ⎦

275
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

x1 x2 x3 s1 s2 t1 t2 W
x1 ⎡ 1
1 –2 0 –2 1 1 1 – 12 0 3⎤
⎢ 2 2 ⎥
x3 ⎢0 3 1 –1 –1 1 1 0 5 ⎥
⎢ 2 2 2 2 2 ⎥
W ⎢0 1 0 3 2 –3 + M –2 + M 1 –28⎥
⎣ ⎦
The minimum is Z = 28 when x1 = 3, x2 = 0, x3 = 5 .

x1 x2 x3 s1 s2 t2 W
⎡ 1 –1 –1 1 0 0 0 3⎤
10. ⎢ ⎥
⎢ 1 –1 1 0 –1 1 0 3⎥
⎢ 4 4 6 0 0 M 1 0⎥
⎣ ⎦
x1 x2 x3 s1 s2 t2 W
s1 ⎡ 1 –1 –1 1 0 0 0 3 ⎤3
⎢ ⎥
t2 ⎢ 1 –1 1 0 –1 1 0 3 ⎥3
W ⎢ 4 – M 4 + M 6 – M 0 M 0 1 –3M ⎥
⎣ ⎦
Here we choose t2 as the departing variable.
x1 x2 x3 s1 s2 t2 W
s1 ⎡ 0 0 –2 1 1 –1 0 0⎤
⎢ ⎥
x1 ⎢ 1 –1 1 0 –1 1 0 3⎥
W ⎢ 0 8 2 0 4 –4 + M 1 –12⎥
⎣ ⎦
Thus Z has a minimum value of 12 when x1 = 3, x2 = 0, x3 = 0.
If we choose s1 as the departing variable, then
x1 x2 x3 s1 s2 t2 W
s1 ⎡ 1 –1 –1 1 0 0 0 3 ⎤3
⎢ ⎥
t2 ⎢ 1 –1 1 0 –1 1 0 3 ⎥3
W ⎢4 – M 4+M 6–M 0 M 0 1 –3M ⎥
⎣ ⎦
x1 x2 x3 s1 s2 t2 W
x1 ⎡1 –1 –1 1 0 0 0 3 ⎤
⎢ ⎥
t2 ⎢ 0 0 2 –1 –1 1 0 0 ⎥ 0
W ⎢0 8 10 – 2M –4 + M M 0 1 –12 ⎥
⎣ ⎦
x1 x2x3 s1 s2 t2 W
x1 ⎡ 1 –1 0 1 –21 1 0 3⎤
⎢ 2 2 ⎥
x3 ⎢ 0 0 1 – 12 – 12 1 0 0 ⎥
⎢ 2 ⎥
W ⎢⎣ 0 8 0 1 5 –5 + M 1 –12 ⎥
⎦
The minimum is Z = 12 when x1 = 3, x2 = 0, x3 = 0 .

276
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.7

11. Let x1 , x2 , and x3 denote the annual numbers of barrels of cement produced in kilns that use device A, device B,
and no device, respectively. We want to minimize the annual emission control cost C (C in dollars) where
1 2
C = x1 + x2 + 0 x3 subject to
4 5
x1 + x2 + x3 = 3,300, 000,
1 1
x1 + x2 + 2 x3 ≤ 1, 000,000,
2 4
x1 , x2 , x3 ≥ 0.
x1 x2 x3 s2 t1 W
⎡ ⎤
⎢1 1 1 0 1 0 3,300, 000 ⎥
⎢1 1 2 1 0 0 1, 000, 000 ⎥⎥
⎢2 4
⎢1 2 0 0 M 1 ⎥
0⎥
⎣⎢ 4 5 ⎦
x1 x2 x3 s2 t1 W
⎡ ⎤
t1 ⎢ 1 1 1 0 1 0 3,300, 000 ⎥ 3,300, 000
s2 ⎢⎢ 1
2
1
4
2 1 0 0 1, 000, 000 ⎥⎥ 500, 000
W ⎢1 –M 2 –M –M 0 0 1 –3,300, 000 M ⎥
⎥
⎢⎣ 4 5 ⎦
x1 x2 x3 s2 t1 W
⎡ 3 7 0 – 12 1 0 2,800, 000 ⎤ 3, 200, 000
t1 ⎢ 4 8 ⎥
x3 ⎢⎢ 14 1
8
1 1
2
0 0 500, 000 ⎥⎥ 4, 000, 000
W ⎢1 – 3 M 2 – 7 M 0 1 M 0 1 –2,800, 000M ⎥
⎥
⎢⎣ 4 4 5 8 2 ⎦
x1 x2 x3 s2 t1 W
⎡ 6 8 ⎤
x2 ⎢ 7 1 0 – 74 7
0 3, 200, 000 ⎥ 11,200,000
3
⎢ ⎥
x3 ⎢ 17 0 1 74 – 17 0 100, 000 ⎥ 700, 000
W ⎢ 13 ⎥
⎢– 0 0 8 – 16 + M 1 –1, 280, 000 ⎥
⎣ 140 35 35 ⎦
x1 x2 x3 s2 – C
⎡ ⎤
x2 ⎢ 0 1 –6 –4 0 2, 600, 000⎥
x1 ⎢ 1 0 7 4 0 700, 000⎥
⎢ ⎥
–C ⎢ 0 0 13 3 1 –1, 215, 000 ⎥
⎣ 20 5 ⎦
Thus the minimum value of C is 1,215,000 when x1 = 700, 000, x2 = 2, 600, 000, x3 = 0.
The plant should install device A on kilns producing 700,000 barrels annually, and device B on kilns producing
2,600,000 barrels annually.

277
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

12. Let x1 be the number of Baltic Avenue lots.

Let x2 be the number of Park Place lots.
We want to minimize C = 3x1 + 4 x2 subject to
6 x1 + 4 x2 = 24,
x1 + 2 x2 ≥ 8,
x1 , x2 ≥ 0.
x1 x2 s1 s2 t1 t2 W
⎡6 4 –1 0 1 0 0 24 ⎤
⎢ ⎥
⎢1 2 0 –1 0 1 0 8⎥
⎢3 4 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W
t1 ⎡ 6 4 –1 0 1 0 0 24 ⎤ 4
⎢ ⎥
t2 ⎢ 1 2 0 –1 0 1 0 8 ⎥8
W ⎢3 − 7 M 4 − 6 M M M 0 0 1 –32M ⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W
⎡ ⎤
x1 ⎢1 2
3
− 16 0 1
6
0 0 4 ⎥6
⎢ ⎥
t2 ⎢ 0 4
3
1
6
−1 − 16 1 0 4 ⎥3
⎢ ⎥
W ⎢ 0 2 − 4 M 1 − 1 M M − 1 + 7 M 0 1 −12 − 4M ⎥
⎣ 3 2 6 2 6 ⎦
x1 x2 s1 s2 t1 t2 W
x1 ⎡ 1 0 – 14 1 1 – 12 0 2⎤
⎢ 2 4 ⎥
x2 ⎢⎢ 0 1 1 –3
8 4
– 1
8
3 0
4
3 ⎥
⎥
⎢ 1 3 – 1 + M – 3 + M 1 –18 ⎥
W ⎢0 0 ⎥⎦
⎣ 4 2 4 2
The minimum value of C is $1,800,000 when 2 Baltic Avenue lots are purchased and 3 Park Place lots are
purchased.

13. Let x1 = number of DVD players shipped from Akron to Columbus,

x2 = number of DVD players shipped from Springfield to Columbus,
x3 = number of DVD players shipped from Akron to Dayton,
x4 = number of DVD players shipped from Springfield to Dayton.
We want to minimize C = 5 x1 + 3x2 + 7 x3 + 2 x4 subject to
x1 + x2 = 150,
x3 + x4 = 150,
x1 + x3 ≤ 200,
x2 + x4 ≤ 150,
x1 , x2 , x3 , x4 ≥ 0.

278
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.7

x1 x2 x3 x4 s3 s4 t1 t2 W
⎡1 1 0 0 0 0 1 0 0 150⎤
⎢0 0 1 1 0 0 0 1 0 150⎥⎥
⎢
⎢1 0 1 0 1 0 0 0 0 200⎥
⎢ ⎥
⎢0 1 0 1 0 1 0 0 0 150⎥
⎢5 3 7 2 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 x3 x4 s3 s4 t1 t2 W
t1 ⎡ 1 1 0 150 ⎤
0 0 0 1 0 0
t2 ⎢ 0 0 1 150 ⎥⎥ 150
1 0 0 0 1 0
⎢
s3 ⎢ 1 0 1 0 1 0 0 0 0 200 ⎥
⎢ ⎥
s4 ⎢ 0 1 0 1 0 1 0 0 0 150 ⎥ 150
W ⎢⎣⎢5 − M 3 − M 7 − M 2 − M 0 0 0 0 1 −300 M ⎥⎦⎥
x1 x2 x3 x4 s3 s4 t1 t2 W
t1 ⎡ 1 1 0 0 0 0 1 0 0 150 ⎤ 150
⎢ 0 0 1 1 0 0 0 1 0 150 ⎥⎥
x4 ⎢
s3 ⎢ 1 0 1 0 1 0 0 0 0 200 ⎥
⎢ ⎥
s4 ⎢ 0 1 −1 0 0 1 0 −1 0 0⎥ 0
W ⎢⎢⎣5 − M 3 − M 5 0 0 0 0 −2 + M 1 −300 − 150M ⎥⎥
⎦
x1 x2 x3 x4 s3 s4 t1 t2 W
t1 ⎡ 1 0 1 0 0 −1 1 1 0 150 ⎤ 150
⎢ ⎥
x4 ⎢ 0 0 1 1 0 0 0 1 0 150 ⎥
s3 ⎢ 1 0 1 0 1 0 0 0 0 200 ⎥ 200
⎢ ⎥
x2 ⎢ 0 1 −1 0 0 1 0 −1 0 0⎥
W ⎢⎢⎣5 − M 0 8− M 0 0 −3 + M 0 1 1 −300 − 150M ⎥⎥
⎦
x1 x2 x3 x4 s3 s4 t1 t2 W
x1 ⎡ 1 0 1 0 0 −1 1 1 0 150 ⎤
x4 ⎢⎢ 0 0 1 1 0 0 0 1 0 150 ⎥⎥
s3 ⎢ 0 0 0 0 1 1 −1 −1 0 50 ⎥
⎢ ⎥
x2 ⎢ 0 1 −1 0 0 1 0 −1 0 0⎥
W ⎢⎣ 0 0 3 0 0 2 −5 + M −4 + M 1 −1050 ⎥⎦
The retailer should ship as follows: to Columbus, 150 from Akron and 0 from Springfield; to Dayton, 0 from
Akron and 150 from Springfield. The transportation cost is $1050.
If s4 is chosen as the departing variable in the second table, the result is the same, although the final table is
different:
x1 x2 x3 x4 s3 s4 t1 t2 W
x1 ⎡ 1 1 0 0 0 0 1 0 0 150 ⎤
⎢
x3 ⎢ 0 −1 1 0 0 −1 0 1 0 0 ⎥⎥
s3 ⎢ 0 0 0 0 1 1 −1 −1 0 50 ⎥
⎢ ⎥
x4 ⎢ 0 1 0 1 0 1 0 0 0 150 ⎥
W ⎢ 0 3 0 0 0 5 −5 + M −7 + M 1 −1050 ⎥
⎣ ⎦

279
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

14. Let x A = number of alternators from supplier X to plant A

xB = number of alternators from supplier X to plant B
yA = number of alternators from supplier Y to plant A
yB = number of alternators from supplier Y to plant B
We want to minimize C = 300 x A + 320 xB + 340 y A + 280 yB subject to
x A + y A = 7000
xB + yB = 5000
x A + xB ≥ 3000
x A + xB ≤ 5000
y A + y B ≥ 7000
x A , xB , y A , y B ≥ 0
x A xB y A y B s3 s4 s5 t1 t2 t3 t5 W
⎡ 1 0 1 0 0 0 0 1 0 0 0 0 7000 ⎤
⎢ 0 1 0 1 0 0 0 0 1 0 0 0 5000 ⎥
⎢ ⎥
⎢ 1 1 0 0 − 1 0 0 0 0 1 0 0 3000 ⎥
⎢ 1 1 0 0 0 1 0 0 0 0 0 0 5000 ⎥
⎢ 0 0 1 1 0 0 −1 0 0 0 1 0 7000 ⎥
⎢300 320 340 280 0 0 0 M M M M 1 0 ⎥⎦
⎣
xA xB yA yB s3 s4 s5 t1 t2 t3 t5 W
t1 ⎡ 1 0 1 0 0 0 0 1 0 0 0 0 7000 ⎤
t2 ⎢ 0 1 0 1 0 0 0 0 1 0 0 0 5000⎥ 5000
⎢ ⎥
t3 ⎢ 1 1 0 0 −1 0 0 0 0 1 0 0 3000 ⎥
s4 ⎢ 1 1 0 0 0 1 0 0 0 0 0 0 5000 ⎥
t5 ⎢ 0 0 1 1 0 0 −1 0 0 0 1 0 7000⎥ 7000
⎢ 1 −22, 000M ⎥⎦
W ⎣300 − 2M 320 − 2M 340 − 2M 280 − 2M M 0 M 0 0 0 0
x A xB yA y B s3 s4 s5 t1 t2 t3 t5 W
t1 ⎡ 1 0 1 0 0 0 0 1 0 0 0 0 7000 ⎤ 7000
yB ⎢ 0 1 0 1 1 0 0 0 1 0 0 0 5000 ⎥
⎢ ⎥
t3 ⎢ 1 1 0 0 −1 0 0 0 0 1 0 0 3000 ⎥ 3000
s4 ⎢ 1 1 0 0 0 1 0 0 0 0 0 0 5000 ⎥ 5000
t5 ⎢ 0 − 1 1 0 0 0 −1 0 −1 0 1 0 2000 ⎥
⎢300 − 2M 40 340 − 2M 0 M 0 M 0 −280 + 2 M 0 0 1 −1, 400, 000 − 12, 000M ⎥⎦
W⎣
xA xB y A yB s3 s4 s5 t1 t2 t3 t5 W
t1 ⎡0 −1 1 0 1 0 0 1 0 −1 0 0 4000 ⎤ 4000
y B ⎢0 1 0 1 0 0 0 0 1 0 0 0 5000 ⎥
⎢ ⎥
xA ⎢ 1 1 0 0 −1 0 0 0 0 1 0 0 3000 ⎥
s4 ⎢0 0 0 0 1 1 0 0 0 −1 0 0 2000 ⎥
t5 ⎢0 −1 1 0 0 0 −1 0 −1 0 1 0 2000 ⎥ 2000
⎢ 0 −280 + 2 M −300 + 2M 0 1 −2,300, 000 − 6000 M ⎥⎦
W ⎣0 −260 + 2M 340 − 2M 0 300 − M 0 M
x A xB yA yB s3 s4 s5 t1 t2 t3 t5 W
t1 ⎡ 0 0 0 0 1 0 1 1 1 −1 −1 0 2000 ⎤ 2000
yB ⎢ 0 1 0 1 0 0 0 0 1 0 0 0 5000 ⎥
⎢ ⎥
xA ⎢ 1 1 0 0 −1 0 0 0 0 1 0 0 3000 ⎥
s4 ⎢0 0 0 0 1 1 0 0 0 −1 0 0 2000 ⎥ 2000
y A ⎢0 −1 1 0 0 0 −1 0 −1 0 1 0 2000 ⎥
⎢ 0 300 − M 0 340 − M 0 60 −300 + 2M −340 + 2 M 1 2,980, 000 − 2000M ⎥⎦
W ⎣0 80 0
We choose t1 as the departing variable.

280
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.7

x A xB yA yB s3 s4 s5 t1 t2 t3 t5 W
s3 ⎡ 0 0 0 0 1 0 1 1 1 −1 −1 0 2000 ⎤
yB ⎢0 1 0 1 0 0 0 0 1 0 0 0 5000 ⎥
⎢ ⎥
xA ⎢ 1 1 0 0 0 0 1 1 1 0 −1 0 5000 ⎥
s4 ⎢ 0 0 0 0 0 1 −1 −1 −1 0 1 0 0⎥
y A ⎢ 0 −1 1 0 0 0 −1 0 −1 0 1 0 2000 ⎥
⎢ 0 40 −300 + M −240 + M M −40 + M 1 −3,580, 000 ⎥⎦
W ⎣ 0 80 0 0 0
The manufacturer should order 5000 alternators from X to be shipped to A, 2000 from Y to A, and 5000 from Y to
B. The minimum cost is $3,580,000. (Note that the same result is obtained if s4 is chosen as the departing
variable in the fifth table.)

15. a. Roll width ⎧15" 3 2 1 0

⎨10"
⎩ 0 1 3 4
Trim loss 3 8 3 8

b. We want to minimize L = 3x1 + 8 x2 + 3x3 + 8 x4 subject to

3 x1 + 2 x2 + x3 ≥ 50,
x2 + 3 x3 + 4 x4 ≥ 60,
x1 , x2 , x3 , x4 ≥ 0.
x1 x2 x3 x4 s1 s2 t1 t2 W
⎡3 2 1 0 –1 0 1 0 0 50 ⎤
⎢ ⎥
⎢0 1 3 4 0 –1 0 1 0 60⎥
⎢3 8 3 8 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 x3 x4 s1 s2 t1 t2 W
t1 ⎡ 3 2 1 0 –1 0 1 0 0 50 ⎤ 50
⎢ ⎥
t2 ⎢ 0 1 3 4 0 –1 0 1 0 60 ⎥ 20
W ⎢ 3 – 3M 8 – 3M 3 – 4 M 8 – 4 M M M 0 0 1 –110M ⎥
⎣ ⎦
x1 x2 x3 x4 s1 s2 t1 t2 W
⎡ 3 5 0 – 34 –1 1 1 – 13 0 30 ⎤
t1 ⎢ 3 3 ⎥ 10
⎢
x3 ⎢ 0 1 1 4 0 – 13 0 1 0 20 ⎥
3 3 3 ⎥
W ⎢ 3 – 3M 7 – 5 M 0 4 + 4 M M 1 – 13 M 0 –1 + 34 M
⎥
1 –60 – 30M ⎥
⎢⎣ 3 3 ⎦
x1 x2 x3 x4 s1 s2 t1 t2 W
⎡1 5 0 – 4 – 1 1 1 – 1 0 10 ⎤
x1 ⎢ 9 9 3 9 3 9 ⎥
⎢
x3 ⎢ 0 3 1 1 4 0 –3 1 0 1 0 20 ⎥⎥
3 3
W ⎢ 0 16 0 16 1 2 –1 + M – 23 + M
⎥
1 –90 ⎥
⎢⎣ 3 3 3 ⎦
x1 = 10, x2 = 0, x3 = 20, x4 = 0.

c. 90 in.

281
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

Apply It 7.8

7. Let x1 , x2 , and x3 be the numbers respectively, of Type 1, Type 2, and Type 3 gadgets produced. The original
problem is to maximize
P = 300 x1 + 200 x2 + 200 x3 , subject to
300 x1 + 220 x2 + 180 x3 ≤ 60, 000,
20 x1 + 40 x2 + 20 x3 ≤ 2000,
3 x1 + x2 + 2 x3 ≤ 120,
and x1 , x2 , x3 ≥ 0.
The dual problem is to minimize
W = 60, 000 y1 + 2000 y2 + 120 y3 ,
subject to
300 y1 + 20 y2 + 3 y3 ≥ 300,
220 y1 + 40 y2 + y3 ≥ 200,
180 y1 + 20 y2 + 2 y3 ≥ 200,
and y1 , y2 , y3 ≥ 0.

8. Let x1 and x2 be the amounts, respectively of supplement 1 and supplement 2. The original problem is to
minimize C = 6 x1 + 2 x2 , subject to
20 x1 + 6 x2 ≥ 98,
8 x1 + 16 x2 ≥ 80,
and x1 , x2 ≥ 0.
The dual problem is to maximize
W = 98 y1 + 80 y2 , subject to
20 y1 + 8 y2 ≤ 6,
6 y1 + 16 y2 ≤ 2,
and y1 , y2 ≥ 0.

9. Let x1 , x2 , and x3 be the numbers, respectively, of devices 1, 2, and 3 produced.

The original problem is to maximize P = 30 x1 + 20 x2 + 20 x3 , subject to
30 x1 + 15 x2 + 10 x3 ≤ 300, 20 x1 + 30 x2 + 20 x3 ≤ 400, 40 x1 + 30 x2 + 25 x3 ≤ 600, and x1 , x2 , x3 ≥ 0.
The dual problem is to minimize W = 300 y1 + 400 y2 + 600 y3 , subject to
30 y1 + 20 y2 + 40 y3 ≥ 30, 15 y1 + 30 y2 + 30 y3 ≥ 20,
10 y1 + 20 y2 + 25 y3 ≥ 20,
and y1 , y2 , y3 ≥ 0.
The tables to maximize Z = −W = −300 y1 − 400 y2 − 600 y3 follow.
y1 y2 y3 s1 s2 s3 t1 t2 t3 Z
⎡ 30 20 40 −1 0 0 1 0 0 0 30⎤
⎢ 15 30 30 0 −1 0 0 1 0 0 20⎥⎥
⎢
⎢ 10 20 25 0 0 −1 0 0 1 0 20⎥
⎢ ⎥
⎢⎣300 400 600 0 0 0 M M M 1 0⎥⎦

282
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.8

y1 y2 y3 s1 s2 s3 t1 t2 t3 Z
t1 ⎡ 30 20 40 –1 0 0 1 0 0 0 30 ⎤
⎢ 15 30 30 0 −1 0 0 1 0 0 20 ⎥⎥
t2 ⎢
t3 ⎢ 10 20 25 0 0 −1 0 0 1 0 20 ⎥
⎢ ⎥
Z ⎢⎣300 – 55M 400 – 70M 600 – 95M M M M 0 0 0 1 –70 M ⎦⎥
y1 y2 y3 s1 s2 s3 t1 t2 t3 Z
⎡ 10 −20 0 −1 4 0 1 −3 4 0 0 10 ⎤
t1 ⎢ 3 3 ⎥
⎢ 1 1 1 0 − 1 0 0 1 0 0 2 ⎥
y3 ⎢ 2 30 30 3 ⎥
t3 ⎢ − 5 − 5 0 0 5 − 1 0 − 5 1 0 10 ⎥
⎢ 2 6 6 3 ⎥
Z ⎢ 15
− M –200 + 25M 0 M 20 − 6 M M 0 −20 + 6 M 0 1 −400 − 3 M ⎥
13 19 20
⎢⎣ 2 ⎥⎦
y1 y2 y3 s1 s2 s3 t1 t2 t3 Z
y1 ⎡1 −2 0 − 10 1 2 0 1 − 152 0 0 1 ⎤
⎢ 15 10 3 ⎥
⎢0 2 1 20 1 − 10
1 0 − 20 1 1 0 0 1 ⎥
y3 ⎢ 10 2 ⎥
t3 ⎢ 0 −10 0 −4 1 7 −1 1 −6 7 1 0 25 ⎥
⎢ 6 4 6 ⎥
⎢ 3 M −20 + 13 M 0 1 −400 − 25 M ⎥
Z ⎢ 0 − 200 + 10 M 0 1 M 20 − 7 M M
⎥⎦
⎣ 4 6 4 6 6

y1 y2 y3 s1 s2 s3 t1 t2 t3 Z
s2 ⎡ 15 −15 0 −4 3 1 0 3 −1 0 0 5 ⎤
⎢ 2 4 2 ⎥
⎢ 3 1 1 − 1 0 0 1 0 0 0 3 ⎥
y3 ⎢ 4 2 40 40 4 ⎥
t3 ⎢ − 35 15 0 5 0 − 1 − 5 0 1 0 5 ⎥
⎢ 4 2 8 8 4 ⎥
⎢ ⎥
Z ⎢ −150 + 4 M 100 − 2 M 0 15 − 8 M 0 M −15 + 8 M M 0 1 −450 − 4 M ⎥
35 15 5 13 5
⎣ ⎦
y1 y2 y3 s1 s2 s3 t1 t2 t3 Z
s2 ⎡ −10 0 0 1 1 −2 −2 1 −1 2 0 5 ⎤
⎢ 2 ⎥
⎢ 4 0 1 − 1 0 1 1 0 − 1 0 2 ⎥
y3 ⎢ 3 15 15 15 15 3 ⎥
y2 − ⎢ ⎥
⎢ 6 1 0 12 0 − 15 − 12
7 1 2 1 0 2 0 1
15 6 ⎥
⎢ ⎥
Z ⎢ − 100 0 0 20 0 40 − 20 + M M − 40 + M 1 − 1400 ⎥⎦
⎣ 3 3 3 3 3 3

The t1 , t2 , and t3 columns are no longer needed.

y1 y2 y3 s1 s2 s3 Z
s2 ⎡0 0 2 15 0 1 − 32 0 10 ⎤
⎢ ⎥
y1 ⎢ 1 0 3 − 1 0 1 0 1⎥
⎢ 4 20 20 2⎥
⎢
y2 0 1 7 1 0 − 40 0 3 3 ⎥
⎢ 8 40 4⎥
Z ⎢0 0 25 5 0 15 1 −450 ⎥
⎣ ⎦
From this table, the maximum profit of $450 corresponds to x1 = 5, x2 = 0, and x3 = 15.
The company should produce 5 of device 1 and 15 of device 3.

283
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

Problems 7.8 8. The second constraint can be written as

−8 x1 + 10 x2 ≥ −80.
1. Minimize W = 4 y1 + 5 y2
Maximize W = −10 y1 − 80 y2
subject to 3 y1 + 2 y2 ≥ 2 subject to −4 y1 − 8 y2 ≤ 5
− y1 + 3 y2 ≥ 3 3 y1 + 10 y2 ≤ 4
y1 , y2 ≥ 0. y1 , y2 ≥ 0

2. Minimize W = 3 y1 + 5 y2 subject to 9. The dual is: Maximize W = 2 y1 + 3 y2 subject to

2 y1 – y2 ≥ 2, y1 – y2 ≤ 2,
2 y1 + 4 y2 ≥ 1, – y1 + 2 y2 ≤ 2,
2 y2 ≥ –1, 2 y1 + y2 ≤ 5,
y1 , y2 ≥ 0. y1 , y2 ≥ 0.
y1 y2 s1 s2 s3 W
3. Maximize W = 8 y1 + 2 y2 subject to
s1 ⎡ 1 –1 1 0 0 0 2 ⎤
y1 – y2 ≤ 1, ⎢ ⎥
y1 + 2 y2 ≤ 8, s2 ⎢ –1 2 0 1 0 0 2 ⎥ 1
y1 + y2 ≤ 5, s3 ⎢ 2 1 0 0 1 0 5 ⎥ 5
⎢ ⎥
y1 , y2 ≥ 0. W ⎣⎢ –2 –3 0 0 0 1 0 ⎦⎥
y1 y2 s1 s2 s3 W
4. Maximize W = y1 + 2 y2 subject to
s1 ⎡ 1 0 1 1 0 0 3⎤ 6
2 y1 + y2 ≤ 8, ⎢ 2 2 ⎥
2 y1 + 3 y2 ≤ 12, y2 ⎢ – 1 1 0 1 0 0 1 ⎥
y1 , y2 ≥ 0. ⎢ 2 2 ⎥
s3 ⎢ 52 0 0 – 12 1 0 4⎥ 58
⎢ ⎥
5. The second and third constraints can be written ⎢ 7 3 ⎥
W ⎢ – 2 0 0 2 0 1 3⎥
as x1 − x2 ≤ −3 and − x1 − x2 ≤ −11. Minimize ⎣ ⎦
W = 13 y1 – 3 y2 – 11y3 subject to y1 y2 s1 s2 s3 W
– y1 + y2 – y3 ≥ 1, s1 ⎡0 0 1 3 − 15 0 11 ⎤
2 y1 – y2 – y3 ≥ –1, ⎢ 5 5⎥
y2 ⎢ 0 1 0 2 1 0 9⎥
y1 , y2 , y3 ≥ 0. ⎢ 5 5 5⎥
y1 ⎢ 1 0 0 – 15 2 0 8⎥
6. The second constraint can be written as ⎢ 5 5⎥

−3x1 + 4 x2 + x3 ≤ 1. Minimize W = 7 y1 + y2 W ⎢⎢0 0 0 4 7 1 43 ⎥

5 ⎦⎥
⎣ 5 5
subject to
43 4
2 y1 − 3 y2 ≥ 2, The minimum is Z = when x1 = 0, x2 = ,
5 5
−3 y1 + 4 y2 ≥ 5,
y1 + y2 ≥ −2, 7
x3 = .
y1 , y2 ≥ 0. 5

7. The first constraint can be written as 10. The dual is: Maximize W = 28 y1 + 2 y2 + 16 y3
− x1 + x2 + x3 ≥ −3. Maximize W = –3 y1 + 3 y2 subject to
subject to y1 + 2 y2 – 3 y3 ≤ 2,
– y1 + y2 ≤ 4, 4 y1 – y2 + 8 y3 ≤ 2,
y1 – y2 ≤ 4, y1 , y2 , y3 ≥ 0.
y1 + y2 ≤ 6,
y1 , y2 ≥ 0.

284
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.8

y1 y2 y3 s1 s2 W
⎡
s1 1 2 −3 1 0 0 2⎤ 2
⎢ ⎥
s2 ⎢ 4 –1 8 0 1 0 2 ⎥ 12
W ⎢ –28 –2 –16 0 0 1 0⎥
⎣ ⎦
y1 y2 y3 s1 s2 W
s1 ⎡
0 94 –5 1 – 14 0 32 ⎤ 2
⎢ ⎥3
y1 1 – 4 2 0 4 0 2 ⎥
⎢ 1 1 1
⎢ ⎥
W ⎢ 0 –9 40 0 7 1 14 ⎥
⎢⎣ ⎥⎦
y1 y2 y3 s1 s2 W
y2 ⎡
0 1 − 9 94 – 19 0 23 ⎤
20
⎢ ⎥
y1 ⎢ 1 0 13 1 2 0 2⎥
⎢ 9 9 9 3⎥
W ⎢0 0 20 4 6 1 20 ⎥
⎣ ⎦
The minimum is Z = 20 when x1 = 4, x2 = 6 .

11. The dual is: Minimize W = 6 y1 + 10 y2 subject to

2 y1 + y2 ≥ 5,
3 y1 + 4 y2 ≥ 4,
y1 , y2 ≥ 0.
y1 y2 s1 s2 t1 t2 U
⎡ 2 1 –1 0 1 0 0 5⎤
⎢ ⎥
⎢ 3 4 0 –1 0 1 0 4⎥
⎢ 6 10 0 0 M M 1 0⎥
⎣ ⎦
y1 y2 s1 s2 t1 t2 U
t1 ⎡ 2 5 ⎤2
5
1 –1 0 1 0 0
⎢ ⎥
t2 ⎢ 3 4 0 –1 0 1 0 4 ⎥ 43
⎢ ⎥
U ⎢ 6 − 5M 10 − 5M M M 0 0 1 –9M ⎥
⎣ ⎦
y1 y2 s1 s2 t1 t2 U
t1 ⎡ 0 −35 –1 2 1 – 32 0 7 ⎤7
⎢ 3 3 ⎥2
y1 ⎢⎢1 4
3
0 – 13 0 1
3
0 4
3
⎥
⎥
⎢ ⎥
U ⎢ 0 2 + 53 M M 2 – 32 M 0 –2 + 53 M 7
1 –8 – 3 M ⎥
⎣ ⎦
y1 y2 s1 s2 t1 t2 U
s2 ⎡0 − 5 – 3 1 3 –1 0 7⎤
⎢ 2 2 2 2⎥
⎢
y1 1 1 −3 0
1 1 0 0 5 ⎥
⎢ 2 2 2⎥
U ⎢0 7 3 0 –3 + M M 1 –15⎥
⎣ ⎦
The maximum is Z = 15 when x1 = 3, x2 = 0.

285
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

12. The dual is: Minimize W = 12 y1 + 8 y2 subject to

3 y1 + y2 ≥ 2,
y1 + y2 ≥ 6,
y1 , y2 ≥ 0.
y1 y2 s1 s2 t1 t2 U
⎡ 3 1 –1 0 10 0 2⎤
⎢ ⎥
⎢ 1 1 0 –1 0 1 0 6⎥
⎢12 8 0 0 M M 1 0⎥
⎣ ⎦
y1 y2 s1 s2 t1 t2 U
2
t1 ⎡ 3 1 –1 0 1 0 0 2 ⎤3
⎢ ⎥
t2 ⎢ 1 1 0 –1 0 1 0 6 ⎥6
⎢
U 12 – 4 M 8 – 2M M M 0 0 1 –8M ⎥
⎣ ⎦
y1 y2 s1 s2 t1 t2 U
y1 ⎡1 1 – 13 0 1 0 0 2⎤2
⎢ 3 3 3⎥
t2 ⎢⎢0 2
3
1
3
–1 – 13 1 0 16
3
⎥
⎥8
U ⎢0 4 – 2 M 4 – 1 M M –4 + 34 M 16 ⎥
0 1 –8 – 3 M ⎥
⎣⎢ 3 3 ⎦
y1 y2 s1 s2 t1 t2 U
y2 ⎡ 3 1 –1 0 1 0 0 2 ⎤
⎢ ⎥
t2 ⎢ –2 0 1 –1 –1 1 0 4 ⎥4
U ⎢ –12 + 2M 0 8 – M M –8 + 2 M 0 1 –16 – 4M ⎥
⎣ ⎦
y1 y2 s1 s2 t1 t2 U
y2 ⎡ 1 1 0 –1 0 1 0 6⎤
⎢ ⎥
s1 ⎢ –2 0 1 –1 –1 1 0 4⎥
U ⎢ 4 0 0 8 M –8 + M 1 –48⎥
⎣ ⎦
The maximum is Z = 48 when x1 = 0, x2 = 8 .

13. The first constraint can be written as x1 − x2 ≥ −1. The dual is: Maximize W = – y1 + 3 y2 subject to
y1 + y2 ≤ 6,
– y1 + y2 ≤ 4,
y1 , y2 ≥ 0.
y1 y2 s1 s2 W
⎡
s1 1 1 1 0 0 6⎤ 6
⎢ ⎥
s2 ⎢ –1 1 0 1 0 4⎥ 4
W⎢1 –3 0 0 1 0⎥
⎣ ⎦
y1 y2 s1 s2 W
s1 ⎡ 2 0 1 –1 0 2 ⎤ 1
⎢ ⎥
y2 ⎢ –1 1 0 1 0 4⎥
W ⎢ –2 0 0 3 1 12⎥
⎣ ⎦

286
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Section 7.8

y1 y2 s1 s2 W y1 y2 s1 s2 W
y1 ⎡
1 0 12 – 12 0 1⎤ ⎡ 1 – 45 0 1 ⎤ 1
s1 ⎢0 80 5 ⎥ 400
⎢ ⎥
y2 ⎢0 1 12 1 0 5 ⎥ y1 ⎢1 1 0 1 0 1 ⎥ 1
⎢ 2 ⎥ ⎢ 2 50 50 ⎥ 25
W ⎢0 0 1 2 1 14 ⎥ W ⎢0 –20,000 0 1600 1 1600 ⎥
⎣ ⎦ ⎣ ⎦
The minimum is Z = 14 when x1 = 1, x2 = 2 . y1 y2 s1 s2 W
⎡
y2 0 1 1 1
– 100 0 1 ⎤
14. The first constraint can be written as ⎢ 80 400 ⎥

−2 x1 + x2 + x3 ≥ −2. The dual is: y1 ⎢ 1 0 – 160 1 1 0 3 ⎥

⎢ 40 160 ⎥
Maximize W = −2 y1 + 4 y2 W ⎢0 0 250 1400 1 1650 ⎥
⎣ ⎦
subject to −2 y1 − y2 ≤2 The firm should spend $250 on newspaper
y1 − y2 ≤1 advertising and $1400 on radio advertising for a
y1 + 2 y2 ≤1 cost of $1650.
y1 , y2 ≥0
y1 y2 s1 s2 s3 W 16. Let x1 = number of type A trucks rented,
x2 = number of type B trucks rented.
s1 ⎡ −2 −1 1 0 0 0 2⎤
s2 ⎢ 1 −1 0 1 0 0 1⎥ We want to minimize C = 0.40 x1 + 0.60 x2
⎢ ⎥
s3 ⎢ 1 2 0 0 1 0 1⎥ 1 subject to
2
W ⎢⎣ 2 −4 0 0 0 1 0⎥⎦ 2 x1 + 2 x2 ≥ 12,
y1 y2 s1 s2 s3 W x1 + 3x2 ≥ 12,
x1 , x2 ≥ 0.
s1 ⎡ − 3 0 1 0 1 0 5 ⎤
⎢ 2 2 2⎥ The dual is: Maximize W = 12 y1 + 12 y2 subject
s2 ⎢ 3 0 0 1 1 0 3 ⎥
2 2 2 to
⎢ ⎥
y2 ⎢ 1 1 0 0 1 0 1 ⎥
2 2 2
2 y1 + y2 ≤ 0.40,
W ⎢⎣ 4 0 0 0 2 1 2 ⎥⎦ 2 y1 + 3 y2 ≤ 0.60,
y1 , y2 ≥ 0.
The minimum is Z = 2 when x1 = 0, x2 = 0,
y1 y2 s1 s2 W
x3 = 2.
s1 ⎡
2 1 1 0 0 25 ⎤ 15
15. Let x1 = amount spent on newspaper ⎢ ⎥
s2 ⎢ 2 3 0 1 0 35 ⎥ 10 3
advertising, ⎢ ⎥
x2 = amount spent on radio advertising. W ⎢ –12 –12 0 0 1 0 ⎥
⎣ ⎦
We want to minimize C = x1 + x2 subject to
Here we choose y1 as the entering variable.
40 x1 + 50 x2 ≥ 80, 000,
y1 y2 s1 s2 W
100 x1 + 25 x2 ≥ 60, 000,
⎡ 1 1 0 0 51 ⎤ 52
x1 , x2 ≥ 0. y1 ⎢1 2 2 ⎥
The dual is: Maximize s2 ⎢0 2 –1 1 0 5 ⎥⎥ 10
⎢ 1 1
W = 80, 000 y1 + 60, 000 y2 subject to
W ⎢0 –6 6 0 1 12 ⎥
40 y1 + 100 y2 ≤ 1, ⎢⎣ 5 ⎥⎦
50 y1 + 25 y2 ≤ 1, y1 y2 s1 s2 W
y1 , y2 ≥ 0. y1 ⎡
1 0 3 –1 0 3 ⎤
y1 y2 s1 s2 W ⎢ 4 4 20 ⎥

s1 ⎡ 40 1 0 0 1 ⎤ 40
1 y2 ⎢0 1 – 12 1 0 1 ⎥
100 ⎢ 2 10 ⎥
⎢ ⎥ 1 W ⎢0 0
s2 ⎢ 50 25 0 1 0 1 ⎥ 50 3 3 1 3⎥
⎣ ⎦
W ⎢ –80, 000 –60, 000 0 0 1 0⎥
⎣ ⎦ Thus the maximum value of W, and hence the
minimum value of C, is 3.

287
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

If we choose y2 as the entering variable, then

y1 y2 s1 s2 W
⎡ 1 1 0 0 25 ⎤ 52
s1 ⎢ 2 ⎥
s2 ⎢ 2 3 0 1 0 35 ⎥ 15
⎢ ⎥
W ⎢ –12 –12 0 0 1 0 ⎥
⎣ ⎦
y1 y2 s1 s2 W
⎡ 4 0 1 –1 0 1 ⎤ 3
s1 ⎢ 3 3 5 ⎥ 20

y2 ⎢ 3 1 0 3 0 5 ⎥⎥ 10
⎢ 2 1 1 3

W ⎢ –4 0 0 4 1 12 ⎥
⎢⎣ 5 ⎥⎦
y1 y2 s1 s2 W
⎡ 3 –1 0 3 ⎤
y1 ⎢ 1 0 4 4 20 ⎥
y2 ⎢0 1 – 12 1 0 1⎥
⎢ 2 10 ⎥
W ⎢0 0 3 3 1 3⎥
⎣ ⎦
The minimum total cost per mile is $3. Three trucks of each type are required.

17. Let y1 = number of shipping clerk apprentices,

y2 = number of shipping clerks,
y3 = number of semiskilled workers,
y4 = number of skilled workers.
We want to minimize W = 6 y1 + 9 y2 + 8 y3 + 14 y4 subject to
y1 + y2 ≥ 60,
–2 y1 + y2 ≥ 0,
y3 + y4 ≥ 90,
y3 – 2 y4 ≥ 0,
y1 , y2 , y3 , y4 ≥ 0.
The dual is: Maximize Z = 60 x1 + 0 x2 + 90 x3 + 0 x4 subject to
x1 – 2 x2 ≤ 6,
x1 + x2 ≤ 9,
x3 + x4 ≤ 8,
x3 – 2 x4 ≤ 14,
x1 , x2 , x3 , x4 ≥ 0.
x1 x2 x3 x4 s1 s2 s3 s4 Z
s1 ⎡ 1 –2 0 0 1 0 0 0 0 6⎤
⎢ 1 1 0 0 0 1 0 0 0 9 ⎥⎥
s2 ⎢
s3 ⎢ 0 0 1 1 0 0 1 0 0 8⎥ 8
⎢ ⎥
s4 ⎢ 0 0 1 –2 0 0 0 1 0 14 ⎥ 14
⎢
Z ⎣ –60 0 –90 0 0 0 0 0 1 0⎥
⎦

288
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Chapter 7 Review

x1 x2 x3 x4 s1 s2 s3 s4 Z
s1 ⎡ 1 –2 0 0 1 0 0 0 0 6 ⎤6
⎢ 9 ⎥⎥ 9
s2 ⎢ 1 1 0 0 0 1 0 0 0
⎢
x3 0 0 1 1 0 0 1 0 0 8 ⎥
⎢ ⎥
s4 ⎢ 0 0 0 –3 0 0 –1 1 0 6 ⎥
⎢
Z ⎣ –60 0 0 90 0 0 90 0 1 720⎥
⎦
x1 x2 x3 x4 s1 s2 s3 s4 Z
x1 ⎡ 1 –2 0 0 1 0 0 0 0 6 ⎤
⎢0 3 0 0 –1 1 0 0 0 3 ⎥⎥ 1
s2 ⎢
x3 ⎢ 0 0 1 1 0 0 1 0 0 8 ⎥
⎢ ⎥
s4 ⎢ 0 0 0 –3 0 0 –1 1 0 6 ⎥
Z ⎢⎣ 0 –120 0 90 60 0 90 0 1 1080 ⎥⎦
x1 x2 x3 x4 s1 s2 s3 s4 Z
⎡ 1 2 8⎤
x1 ⎢ 1 0 0 0 3 3
0 0 0
⎥
x2 ⎢ 0 1 0 0 – 1 1 0 0 0 1⎥
⎢ 3 3 ⎥
x3 ⎢ 0 0 1 1 0 0 1 0 0 8⎥
s4 ⎢ 0 0 0 –3 0 0 –1 1 0
⎥
6⎥
⎢
Z ⎢ 0 0 0 90 20 40 90 0 1 1200 ⎥
⎣ ⎦
The company should employ 20 shipping clerk apprentices, 40 shipping clerks, 90 semiskilled workers, and
0 skilled workers for a total hourly wage of $1200.

Chapter 7 Review Problems

1. y
5

x
5

2. 10
y

x
10

289
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

3. y y
5 8. 5

–5
3 x x
5 5

4. y 9. y
5 10

x x
5 10

5. y y
10 10. 10

x x
10 10

6. y
5 11. Feasible region follows. Corner points are (0, 0),
(0, 2), (1, 3), (3, 1), (3, 0). Z is maximized at
(3, 0) where its value is 3.
x Thus Z = 3 when x = 3 and y = 0.
y
5 5

y−x=2

x+y=4
y
7. 5
x=3 x
(3, 0) 5
x
5

290
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Chapter 7 Review

12. Feasible region follows. Corner points are (0, 1), y

10
(0, 8), (3, 2), and (3, 1). Z is maximized at (3, 2),
where its value is 11. Thus Z = 11 when x = 3 x+y=5
and y = 2.
y ⎛ 20 10 ⎞
⎜ , ⎟
⎝ 9 9⎠
10 2x + 5y = 10
(0, 8) x
2x + y = 8
(4, 0) 10
5x + 8y = 20 (5, 0)

(3, 2) 16. Feasible region follows. Corner points are (0, 4),
x=3
(0, 1) (3, 1) (0, 6), (6, 8), (6, 0), and (4, 0). Z is minimized at
x
(0, 4) and (4, 0) where its value is 8. Thus Z is
y=1 10
minimized at all points on the line segment
joining (0, 4) and (4, 0). The solution is
13. Feasible region is unbounded. Z is minimized at Z = 8 when x = (1 – t)(0) + 4t = 4t,
the corner point (0, 2) where its value is –2. Thus y = (1 – t)(4) + 0t = 4 – 4t, and 0 ≤ t ≤ 1.
Z = –2 when x = 0 and y = 2. y
y 10
5
x − y = −2 −x + 3y = 18 (6, 8)

(0, 6)

(0, 4) x=6
(0, 2)

x+y=1 x − 2y = 2 x+y=4 (6, 0) x

x
(4, 0) 10
5
17. Feasible region follows. Corner points are (0, 0),
14. Feasible region follows. Corner points are (0, 0), (0, 4), (2, 3), and (4, 0). Z is maximized at (2, 3)
⎛ 10 5 ⎞ and (4, 0) where its value is 32. Thus Z is
⎜ , ⎟ , and (0, 5). Z is minimized at (0, 0)
⎝ 3 9⎠ maximized at all points on the line segment
where its value is 0. Thus Z = 0 when x = 0 and joining (2, 3) and (4, 0). The solution is
y = 0. Z = 32 when x = (1 – t)(2) + 4t = 2 + 2t,
y y = (1 – t)(3) + 0t = 3 – 3t, and 0 ≤ t ≤ 1.
10 y
5

(0, 4) x + 2y = 8
4x + 3y = 15
(2, 3)
(0, 5)

⎛ 10 5 ⎞
⎜ , ⎟
⎝ 3 9⎠ x 3x + 2y = 12
(0, 0) 10 x
x – 6y = 0 (0, 0)
(4, 0) 5

15. Feasible region follows. Corner points are 18. Feasible region is unbounded. The family of
⎛ 20 10 ⎞ lines given by Z = 4x + y has members having
⎜ , ⎟ , (5, 0), and (4, 0). Z is minimized at
⎝ 9 9⎠ arbitrarily large values of Z and that also
intersect the feasible region. Thus no optimum
⎛ 20 10 ⎞ 70 70
⎜ , ⎟ where its value is . Thus Z = solution exists.
⎝ 9 9 ⎠ 9 9
20 10
when x = and y = .
9 9

291
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

y x1 x2 s1 s2 s3 Z
20 Z = 40
s1 ⎡ 2 3 1 0 0 0 18 ⎤ 6
⎢ 4 3 0 1 0 0 24⎥⎥ 8
(0, 12)
20. s2 ⎢
s3 ⎢ 0 1 0 0 1 0 5 ⎥5
(4, 6) ⎢ ⎥
3x + 2y = 24 x + 2y = 16 Z ⎢⎣ –18 –20 0 0 0 1 0⎥
⎦
Z = 16 (16, 0) x x1 x2 s1 s2 s3 Z
20 s1 ⎡ 2 0 1 0 –3 0 3 ⎤ 32
⎢ 1 –3 0 9 ⎥⎥ 9
s2 ⎢ 4 0 0
x1 x2 s1 s2 Z 4
x2 ⎢ 0 1 0 0 1 0 5 ⎥
⎡
s1 1 6 1 0 0 12 ⎤ 2 ⎢ ⎥
19. ⎢ ⎥ Z ⎣⎢ –18 0 0 0 20 1 100 ⎥
⎦
s2 ⎢ 1 2 0 1 0 8 ⎥4
Z ⎢ –4 –5 0 0 1 0 ⎥ x1 x2 s1 s2 s3 Z
⎣ ⎦
x1 ⎡1 0 12 0 – 2 0 2 ⎤
3 3
x1 x2 s1 s2 Z ⎢ ⎥
s2 ⎢ 0 0 –2 1 3 0 3 ⎥ 1
x2 ⎡ 1 ⎤
x2 ⎢⎢ 0 1 0 0 1 0 5 ⎥⎥ 5
1
⎢ 6 1 6
0 0 2 ⎥ 12
⎢ ⎥
s2 ⎢ 23 0 – 13 1 0 4⎥ 6 Z ⎢ 0 0 9 0 –7 1 127 ⎥
⎣ ⎦
⎢ ⎥
Z ⎢⎣ – 6 0 1 10 ⎥
19 0 5 x1 x2 s1 s2 s3 Z
6 ⎦
x1 ⎡⎢ 1 0 – 2 3⎤
1 1 0 0
x1 x2 s1 s2 Z 2 ⎥
x2 ⎡ 0 s3 ⎢ 0 0 – 2 1 1 0 1 ⎥
1 1 – 14 0 1 ⎤ 4 ⎢ 3 3 ⎥
⎢ 4 ⎥ ⎢0 1 2 –1 0 0 ⎥
x1 ⎢⎢1 0 6 ⎥⎥ x2 ⎢ 4
0 – 12 3 3 3 ⎥
2
⎢ 13 7 0 1 134 ⎥
Z ⎢0 0 – 34 19 1 29⎥
⎥ Z 0 0
⎢⎣ 3 3 ⎥⎦
⎣⎢ 4 ⎦
Thus Z = 134 when x1 = 3 and x2 = 4 .
x1 x2 s1 s2 Z
⎡
s1 0 4 1 –1 0 4⎤ x1 x2 x3 s1 t1 W
⎢ ⎥
x1 ⎢ 1 2 0 1 0 8⎥ 21. ⎡ 1 2 3 –1 1 0 5⎤
⎢3 2 1 0 M 1 0 ⎥
Z ⎢0 3 0 4 1 32⎥ ⎢⎣ ⎦⎥
⎣ ⎦
Thus Z = 32 when x1 = 8 and x2 = 0. x1 x2 x3 s1 t1 W
5
t1 ⎡ 1 2 3 − 1 1 0 5 ⎤3
⎢ ⎥
W ⎢⎣3 − M 2 − 2M 1 − 3M M 0 1 −5M ⎦⎥
x1 x2 x3 s1 t1 W
⎡1 2 1 − 1 1 0 5⎤
x3 ⎢ 3 3 3 3 3⎥
W ⎢8 4 0 1 − 1 + M 1 − 5⎥
⎣⎢ 3 3 3 3 3 ⎦⎥

5 5
Thus Z = when x1 = 0, x2 = 0, and x3 = .
3 3

292
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Chapter 7 Review

x1 x2 s1 s2 t1 t2 W
⎡2 4 –1 0 1 0 0 2⎤
22. ⎢ ⎥
⎢2 5 0 –1 0 1 0 4⎥
⎢3 5 0 0 M M 1 0⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W
t1 ⎡ 2 2 ⎤2
1
4 –1 0 1 0 0
⎢ ⎥
t2 ⎢ 2 5 0 –1 0 1 0 4 ⎥ 54
W ⎢3 − 4 M 5 − 9M M M 0 0 1 –6M ⎥
⎣ ⎦
x1 x2 s1 s2 t1 t2 W

x2 ⎡⎢ 1 1 – 14 0 1 0 0 1 ⎤
⎥
2 4 2
⎢ ⎥6
t2 ⎢ − 12 0 5
4
–1 − 45 1 0 3
2 ⎥5
⎢ ⎥
W ⎢1 + 1 M 0 5 − 5 M M − 54 + 94 M 0 1 – 52 − 23 M ⎥
⎣2 2 4 4 ⎦
x1 x2 s1 s2 t1 t2 W
x2 ⎡ 25 1 0 − 15 0 ⎤ 1 0 4
⎢ ⎥ 5 5
s1 ⎢ − 52
0 1 −1 – 54 0 ⎥ 4 6
⎢ ⎥ 5 5
W ⎢ 1 0 0 1 M −1 + M 1 –4⎥
⎣ ⎦
4
The minimum is Z = 4 when x1 = 0, x2 = .
5

x1 x2 s1 s2 s3 t2 W
⎡ 1 1 1 0 0 0 0 12 ⎤
⎢ 5⎥⎥
23. ⎢ 1 1 0 –1 0 1 0
⎢ 1 0 0 0 1 0 0 10 ⎥
⎢ ⎥
⎢⎣ –1 –2 0 0 0 M 1 0⎥
⎦
x1 x2 s1 s2 s3 t2 W
s1 ⎡ 1 1 1 0 0 0 0 12 ⎤ 12
⎢ 1 1 0 –1 0 1 0 5 ⎥⎥ 5
t2 ⎢
s3 ⎢ 1 0 0 0 1 0 0 10 ⎥
⎢ ⎥
W ⎢⎣ –1 – M –2 – M 0 M 0 0 1 –5M ⎥
⎦
x1 x2 s1 s2 s3 t2 W
s1 ⎡ 0 0 1 1 0 –1 0 7 ⎤7
⎢1 1 0 –1 0 1 0 5 ⎥⎥
x2 ⎢
s3 ⎢ 1 0 0 0 1 0 0 10 ⎥
⎢ ⎥
W ⎢⎣1 0 0 –2 0 2 + M 1 10 ⎥
⎦

293
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

x1 x2 s1 s2 s3 Z
s2 ⎡ 0 0 1 1 0 0 7 ⎤
⎢ ⎥
x2 ⎢ 1 1 1 0 0 0 12 ⎥
s3 ⎢ 1 0 0 0 1 0 10 ⎥
⎢ ⎥
Z ⎢⎣ 1 0 2 0 0 1 24 ⎦⎥
Thus Z = 24 when x1 = 0 and x2 = 12.

x1 x2 s1 s2 t2 W
⎡1 2 1 0 0 0 6⎤
24. ⎢ ⎥
⎢1 1 0 –1 1 0 1⎥
⎢2 1 0 0 M 1 0⎥
⎣ ⎦
x1 x2 s1 s2 t2 W
s1 ⎡ 1 2 1 0 0 0 6 ⎤3
⎢ ⎥
t2 ⎢ 1 1 0 –1 1 0 1 ⎥ 1
W ⎢2 – M 1 – M 0 M 0 1 – M ⎥
⎣ ⎦
s1 ⎡ –1 0 1 2 –2 0 4 ⎤
⎢ ⎥
x2 ⎢ 1 1 0 –1 1 0 1⎥
W ⎢ 1 0 0 1 –1 + M 1 –1⎥
⎣ ⎦
Thus Z = 1 when x1 = 0 and x2 = 1.

25. We write the first constraint as – x1 + x2 + x3 ≥ 1.

x1 x2 x3 s1 t1 t2 W
⎡ –1 1 1 –1 1 0 0 1⎤
⎢ ⎥
⎢ 6 3 2 0 0 1 0 12 ⎥
⎢ 1 2 1 0 M M 1 0⎥
⎣ ⎦
x1 x2 x3 s1 t1 t2 W
t1 ⎡ –1 1 1 –1 1 0 0 1 ⎤
⎢ ⎥
t2 ⎢ 6 3 2 0 0 1 0 12 ⎥ 2
W ⎢1 – 5M 2 – 4M 1 – 3M M 0 0 1 –13M ⎥
⎣ ⎦
x1 x2 x3 s1 t1 t2 W
t1 ⎡ 0 3 4 –1 1 1 0 3 ⎤2
⎢ 2 3 6 ⎥
x1 ⎢⎢1 1
2
1
3
0 0 1
6
0 2 ⎥4
⎥
W ⎢ 0 3 – 3 M 2 – 4 M M 0 – 1 + 5 M 1 –2 – 3M ⎥
⎢⎣ 2 2 3 3 6 6 ⎥⎦
x1 x2 x3 s1 t1 t2 W
x2 ⎡ 0 1 8 – 2 2 1 0 2 ⎤ 94
⎢ 9 3 3 9 ⎥
x1 ⎢⎢1 0 – 19 1
3
– 1
3
1
9
0 1 ⎥
⎥
W ⎢ 0 0 – 2 1 –1 + M – 1 + M 1 –5⎥
⎢⎣ 3 3 ⎥⎦

294
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Chapter 7 Review

x1 x2 x3 s1 – Z
x3 ⎡ 9⎤
0 98 1 – 34 0
⎢ 4⎥
⎢ 1
x1 ⎢ 1 8 0 1 0 5 ⎥
4 4⎥
– Z ⎢0 3 0 1 1 – 7⎥
⎢⎣ 4 2 2 ⎥⎦

7 5 9
Thus Z = when x1 = , x2 = 0, and x3 = .
2 4 4

x1 x2 x3 s1 s2 t1 W
⎡ 1 1 3 –1 0 1 0 5⎤
26. ⎢ ⎥
⎢ 2 1 4 0 1 0 0 5⎥
⎢ –2 –3 –5 0 0 M 1 0⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 W
5
t1 ⎡ 1 1 3 −1 0 1 0 5⎤ 3
⎢ ⎥
s2 ⎢ 2 1 4 0 1 0 0 5⎥ 54
W ⎢ −2 − M −3 − M −5 − 3M M 0 0 1 −5M ⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 W
⎡ –21 1 0 –1 − 43 1 0 5⎤5
t1 ⎢ 4 4⎥

x3 ⎢⎢ 1
2
1 1
4
0 1
4
0 0 5⎥
4⎥5
⎢1 1 ⎥
+ M – 7−1M 0 M 5+3M 0 1 25 – 54 M ⎥
W ⎣⎢ 2 2 4 4 4 4 4 ⎦
We choose t1 as the departing variable.
x1 x2 x3 s1 s2 t1 W
⎡
x2 −2 1 0 −4 −3 4 0 5⎤
⎢ ⎥
x3 ⎢ 1 0 1 1 1 −1 0 0⎥ 0
W ⎢ −3 0 0 −7 −4 7 + M 1 15⎥
⎣ ⎦
x1 x2 x3 s1 s2 Z
x2 2 1 4 0 1 0 5⎤
⎡
⎢ ⎥
s1 ⎢ 1 0 1 1 1 0 0⎥
Z ⎢ 4 0 7 0 3 1 15⎥
⎣ ⎦
Thus Z = 15 when x1 = 0, x2 = 5, and x3 = 0. Note that choosing x3 as the departing variable results in the same
solution.

295
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

x1 x2 x3 s1 s2 Z indicator is 0, there may be multiple optimum

solutions. Treating s2 as an entering variable,
s1 ⎡ 4 –1 0 1 0 0 2⎤
27. ⎢ ⎥ deleting the t2 -column, changing W to –Z, and
s2 ⎢ –8 2 5 0 1 0 2 ⎥ 52
⎢ ⎥ continuing, we have
Z ⎢ –5 –2 –7 0 0 1 0 ⎥ x1 x2 x3 s1 s2 – Z
⎣ ⎦
s2 ⎡ 1 1
x1 x2 x3 s1 s2 Z 0 12 1 0 1⎤
⎢2 2 ⎥
s1 4 −1 0 1 0 0 2 ⎤ 1
⎡
x3 ⎢ 12 12 1 12 0 0 2 ⎥
⎢ ⎥2 ⎢ ⎥
x3 ⎢⎢ – 58 52 1 0 51 0 52 ⎥⎥ – Z ⎢ 1 1 0 0 0 1 0⎥
⎣ ⎦
Z ⎢ – 81 4 0 0 7 1 14 ⎥ Here Z = 0 when x1 = 0, x2 = 0, and x3 = 2. Thus
⎢⎣ 5 5 5 5 ⎥⎦
multiple optimum solutions exist. Hence Z is
x1 x2 x3 s1 s2 Z minimum when
⎡
x1 1 − 14 0 14 0 0 1⎤ x1 = (1 – t )(0) + 0t = 0,
⎢ 2⎥
⎢ 6⎥
x2 = (1 – t )(0) + 0t = 0,
x3 ⎢ 0 2
0 1 5 5 0 1
5⎥ x3 = (1 – t )(1) + 2t = 1 + t ,
⎢ ⎥
Z ⎢0 − 13 81 7
0 20 5 1 10 ⎥ 109 and 0 ≤ t ≤ 1. For the last table, s1 is nonbasic
⎣ 4 ⎦
and its indicator is 0. If we continue the process
For the last table, x2 is the entering variable. for determining other optimum solutions, we
Since no quotients exist, the problem has an return to a table corresponding to the third table.
unbounded solution. That is, no optimum
solution exists (unbounded). 29. The dual is: Maximize W = 35 y1 + 25 y2 subject
to
x1 x2 x3 s1 s2 t2 W y1 + y2 ≤ 2,
⎡1 1 2 1 0 0 0 4⎤ 2 y1 + y2 ≤ 7,
28. ⎢ ⎥
⎢0 0 1 0 –1 1 0 1⎥ 3 y1 + y2 ≤ 8,
⎢1 1 0 0 0 M 1 0⎥ y1 , y2 ≥ 0.
⎣ ⎦
y1 y2 s1 s2 s3 W
x1 x2 x3 s1 s2 t2 W
s1 ⎡ 1 1 1 0 0 0 2⎤ 2
s1 ⎡1 1 2 1 0 0 0 4 ⎤2 ⎢ 2
⎢ ⎥ s2 ⎢ 1 0 1 0 0 7 ⎥⎥ 72
t2 ⎢ 0 0 1 0 –1 1 0 1 ⎥ 1
s3 ⎢ 3 1 0 0 1 0 8⎥ 8
W ⎢1 1 – M 0 M 0 1 – M ⎥ ⎢ ⎥3
⎣ ⎦ W ⎣⎢ –35 –25 0 0 0 1 0⎥
⎦
x1 x2 x3 s1 s2 t2 W
y1 y2 s1 s2 s3 W
s1 ⎡1 1 0 1 2 –2 0 2 ⎤ 1
⎢ ⎥ y1 ⎡ 1 1 1 0 0 0 2 ⎤
x3 ⎢ 0 0 1 0 –1 1 0 1 ⎥ ⎢ ⎥
s2 ⎢0 –1 –2 1 0 0 3⎥
W ⎢1 1 0 0 0 M 1 0 ⎥
⎣ ⎦ s3 ⎢0 –2 –3 0 1 0 2 ⎥
The minimum value of Z is 0 for ⎢ ⎥
W ⎢⎣0 10 35 0 0 1 70 ⎦⎥
x1 = 0, x2 = 0, and x3 = 1.
Since s2 is nonbasic for the last table and its Thus Z = 70 when x1 = 35, x2 = 0, and x3 = 0.

296
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Chapter 7 Review

30. We write the third constraint as −4 x1 − x2 ≤ −2. The dual is: Minimize W = 3 y1 + 4 y2 – 2 y3 subject to
y1 + y2 – 4 y3 ≥ 1,
– y1 + 2 y2 – y3 ≥ –2,
y1 , y2 , y3 ≥ 0.
We write the second constraint of the dual as y1 – 2 y2 + y3 ≤ 2.
y1 y2 y3 s1 s2 t1 U
⎡ 1 1 –4 –1 0 1 0 1⎤
⎢ ⎥
⎢ 1 –2 1 0 1 0 0 2⎥
⎢3 4 –2 0 0 M 1 0 ⎥
⎣ ⎦
y1 y2 y3 s1 s2 t1 U
t1 ⎡ 1 1 –4 –1 0 1 0 1 ⎤1
⎢ ⎥
s2 ⎢ 1 –2 1 0 1 0 0 2 ⎥2
⎢
U 3 – M 4 – M –2 + 4M M 0 0 1 –M ⎥
⎣ ⎦
y1 y2 y3 s1 s2 t1 U
⎡
y1 1 1 –4 –1 0 1 0 1⎤
⎢ ⎥
s2 ⎢0 –3 5 1 1 –1 0 1⎥
U ⎢0 1 10 3 0 –3 + M 1 –3⎥
⎣ ⎦
Thus Z = 3 when x1 = 3 and x2 = 0.

31. Let x, y, and z denote the numbers of units of X, Y, and Z produced weekly, respectively. If P is the total profit
obtained, we want to maximize P = 10x + 15y + 22z subject to
x + 2 y + 2 z ≤ 40,
x + y + 2 z ≤ 34,
x, y, z ≥ 0.
x y z s1 s2 P
⎡
s1 1 2 2 1 0 0 40 ⎤ 20
⎢ ⎥
s2 ⎢ 1 1 2 0 1 0 34 ⎥ 17
P ⎢ –10 –15 –22 0 0 1 0 ⎥
⎣ ⎦
x y z s1 s2 P
s1 ⎡ 0 1 0 1 –1 0 6 ⎤ 6
⎢ ⎥
z ⎢ 12 12 1 0 12 0 17 ⎥ 34
⎢ ⎥
P ⎢ 1 –4 0 0 11 1 374 ⎥
⎣ ⎦
y ⎡0 1 0 1 –1 0 6⎤
⎢ ⎥
z ⎢ 12 0 1 – 12 1 0 14 ⎥
⎢ ⎥
P⎢ 1 0 0 4 7 1 398⎥
⎣ ⎦
Thus 0 units of X, 6 units of Y, and 14 units of Z give a maximum profit of $398.

297
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

32. We want to maximize P = 10x + 15y + 22z subject to

x + 2 y + 2 z ≤ 40,
x + y + 2 z ≤ 34,
10 x + 15 y + 22 z ≥ 300,
x, y, z ≥ 0.
x y z s1 s2 s3 t3 W
⎡ 1 2 2 1 0 0 0 0 40 ⎤
⎢ 1 1 2 0 1 0 0 0 34 ⎥⎥
⎢
⎢ 10 15 22 0 0 –1 1 0 300 ⎥
⎢ ⎥
–10 –15 –22 0 0 0 M 1 0⎥
⎣⎢ ⎦
x y z s1 s2 s3 t3 W
s1 ⎡ 1 2 2 1 0 0 0 0 40 ⎤ 20
s2 ⎢ 1 1 2 0 1 0 0 0 34 ⎥⎥ 17
⎢
t3 ⎢ 10 15 22 0 0 –1 1 0 300 ⎥ 150
⎢ ⎥ 11
W ⎢ –10 –10M –15 –15M –22 – 22M 0 0 M 0 1 −300 M ⎥
⎣ ⎦
x y z s1 s2 s3 t3 W
s1 ⎡ 1 7 0 1 0 11 1 − 11
1 0 140 ⎤ 140
⎢ 11 11 11 ⎥
s2 ⎢ 1 − 4 0 0 1 1 − 11
1 0 11 74 ⎥ 74
⎢ 11 11 11 ⎥
z ⎢5 15 1 1 150 ⎥
⎢ 11 22 1 0 0 – 22 22
0 11 ⎥
W ⎢0 0 0 0 0 −1 1 + M 1 300 ⎥
⎣ ⎦
x y z s1 s2 s3 t3 W
s1 ⎡ 0 1 0 1 –1 0 0 0 6 ⎤ 6
⎢ ⎥
s3 ⎢ 1 −4 0 0 11 1 −1 0 74 ⎥
⎢ ⎥
z ⎢ 12 12 1 0 12 0 0 0 17 ⎥ 34
W ⎢ 1 −4 0 0 11 0 M 1 374 ⎥
⎣ ⎦
x y z s1 s2 s3 t3 W
y ⎡ 0 1 0 1 –1 0 0 0 6 ⎤
⎢ 7 1 −1 0 98 ⎥⎥
s3 ⎢ 1 0 0 4
z ⎢ 2 0 1 − 2 1 0 0 0 14 ⎥
1 1
⎢ ⎥
W ⎢1 0 0 4 7 0 M 1 398⎥
⎣ ⎦
Thus 0 units of X, 6 units of Y, and 14 units of Z give a maximum profit of $398.

33. Let x AC , x AD , xBC , and xBD denote the amounts (in hundreds of thousands of gallons) transported from A to C,
A to D, B to C, and B to D, respectively. If C is the total transportation cost in thousands of dollars, we want to
minimize C = x AC + 2 x AD + 2 xBC + 4 xBD subject to
x AC + x AD ≤ 6,
xBC + xBD ≤ 6,
x AC + xBC = 5,
x AD + xBD = 5,
x AC , x AD , xBC , xBD ≥ 0.

298
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Chapter 7 Review

x AC x AD xBC xBD s1 s2 t3 t4 W
⎡1 1 0 0 1 0 0 0 0 6⎤
⎢0 0 1 1 0 1 0 0 0 6⎥⎥
⎢
⎢1 0 1 0 0 0 1 0 0 5⎥
⎢ ⎥
⎢0 1 0 1 0 0 0 1 0 5⎥
⎢1 2 2 4 0 0 M M 1 0⎥
⎣ ⎦
x AC x AD xBC xBD s1 s2 t3 t4 W
s1 ⎡ 1 1 0 0 1 0 0 0 0 6 ⎤6
⎢ 0 0 1 1 0 1 0 0 0 6 ⎥⎥
s2 ⎢
t3 ⎢ 1 0 1 0 0 0 1 0 0 5 ⎥5
⎢ ⎥
t4 ⎢ 0 1 0 1 0 0 0 1 0 5 ⎥
W ⎢⎣1 – M 2–M 2–M 4–M 0 0 0 0 1 –10M ⎥
⎦
x AC x AD xBC xBD s1 s2 t3 t4 W
s1 ⎡0 1 –1 0 1 0 –1 0 0 1⎤ 1
⎢0 0 1 1 0 1 0 0 0 6 ⎥⎥
s2 ⎢
x AC ⎢ 1 0 1 0 0 0 1 0 0 5⎥
⎢ ⎥
t4 ⎢ 0 1 0 1 0 0 0 1 0 5⎥ 5
⎢
W ⎣0 2 – M 1 4 – M 0 0 –1 + M 0 1 –5 – 5M ⎥
⎦
x AC x AD xBC xBD s1 s2 t3 t4 W
x AD ⎡0 1 –1 0 1 0 –1 0 0 1 ⎤
⎢0 0 1 1 0 1 0 0 0 6 ⎥
s2 ⎢ ⎥6
x AC ⎢ 1 0 1 0 0 0 1 0 0 5 ⎥5
⎢ ⎥
t4 ⎢ 0 0 1 1 –1 0 1 1 0 4 ⎥4
⎢
W ⎣0 0 3 – M 4 – M –2 + M 0 1 0 1 –7 – 4M ⎥
⎦
x AC x AD xBC xBD s1 s2 t3 t4 W
x AD ⎡0 1 0 1 0 0 0 1 0 5⎤
⎢0 0 0 0 1 1 –1 –1 0 2 ⎥⎥
s2 ⎢
x AC ⎢ 1 0 0 –1 1 0 0 –1 0 1⎥
⎢ ⎥
xBC ⎢0 0 1 1 –1 0 1 1 0 4⎥
W ⎢⎣0 0 0 1 1 0 –2 + M –3 + M 1 –19 ⎥⎦
The minimum value of C is 19, when x AC = 1, x AD = 5, xBC = 4, and xBD = 0. Thus 100,000 gal from A to C,
500,000 gal from A to D, and 400,000 gal from B to C give a minimum cost of $19,000.

34. Let x and y be the weekly sales of Space Traders and Green Dwarf, respectively. We want to maximize
P = 5x + 9y subject to the constraints
30 x + 10 y ≤ 300
20 x + 10 y ≤ 200
10 x + 50 y ≤ 500
x, y ≥ 0
The constraints can be written as

299
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

3x + y ≤ 30
2 x + y ≤ 20
x + 5 y ≤ 50
x, y ≥ 0
⎛ 50 80 ⎞ 970
The feasible region has corner points (0, 0), (0, 10), ⎜ , ⎟ , and (10, 0). P has a maximum of at
⎝ 9 9 ⎠ 9
⎛ 50 80 ⎞ ⎛ 5 8 ⎞
⎜ , ⎟ = ⎜ 5 , 8 ⎟ . The possible integer values are (5, 8), (5, 9), (6, 8), and (6, 9). However, the point (6, 9)
⎝ 9 9 ⎠ ⎝ 9 9⎠
does not satisfy the second or third constraints. Evaluating P at the other three points gives that Jason should sell 5
copies of Space Trader and 9 copies of Green Dwarf, for a weekly profit of $106.
y
50

3x + y = 30
⎛ 50 80 ⎞
⎜ , ⎟
⎝ 9 9 ⎠
(0, 10)
x + 5y = 50
x
2x + y = 20 (10, 0) 50

35. Let x and y represent daily consumption of foods A and B in 100-gram units. We want to minimize C = 8x + 22y
subject to the constraints
8 x + 4 y ≥ 176,
16 x + 32 y ≥ 1024,
2 x + 5 y ≥ 200,
x ≥ 0,
y ≥ 0.
⎛5 ⎞
The feasible region is unbounded with corner points (100, 0), ⎜ , 39⎟ and (0, 44). C has a minimum value at
⎝2 ⎠
(100, 0). Thus the animals should be fed 100 ×100 = 10, 000 grams = 10 kilograms of food A each day.
y
100

8x + 4y = 176

2x + 5y = 200

x
100

36. 20

0 50
0

Z = 0.89 when x = 4.78, y = 9.14

300
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
ISM: Introductory Mathematical Analysis Explore and Extend⎯Chapter 7

37. 10

0 10
−2

Z = 129.83 when x = 9.38, y = 1.63

Explore and Extend⎯Chapter 7

1. CURATIVE TOXIC RELATIVE

UNITS UNITS DISCOMFORT
Drug (per ounce) 500 400 1
Radiation (per min) 1000 600 1
Requirement ≥ 2000 ≤1400
Let x1 = number of ounces of drug and let x2 = number of minutes of radiation. We want to minimize the
discomfort D, where D = x1 + x2 , subject to
500 x1 + 1000 x2 ≥ 2000,
400 x1 + 600 x2 ≤ 1400,
where x1 , x2 ≥ 0.
x2
5

400x1 + 600x2 = 1400

(2, 1) 500x1 + 1000x2 = 2000

x1
5
⎛ 7⎞
The corner points are (0, 2), ⎜ 0, ⎟ , and (2, 1).
⎝ 3⎠
At (0, 2), D = 0 + 2 = 2;
⎛ 7⎞ 7 7
at ⎜ 0, ⎟ , D = 0 + = ;
⎝ 3⎠ 3 3
at (2, 1), D = 2 + 1 = 3.
Thus D is minimum at (0, 2).
The patient should get 0 ounces of drug and 2 minutes of radiation.

2. CURATIVE TOXIC RELATIVE

UNITS UNITS DISCOMFORT
Drug A (per ounce) 600 500 1
Drug B (per ounce) 500 100 2
Radiation (per min) 1000 1000 1
Requirement ≥ 3000 ≤ 2000

301
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 7: Linear Programming ISM: Introductory Mathematical Analysis

Let x1 = number of ounces of drug A,

x2 = number of ounces of drug B, and
x3 = number of minutes of radiation.
We want to minimize the discomfort D, where D = x1 + 2 x2 + x3 , subject to
600 x1 + 500 x2 + 1000 x3 ≥ 3000,
500 x1 + 100 x2 + 1000 x3 ≤ 2000,
x1 , x2 , x3 ≥ 0
To minimize D, we maximize –D by considering the artificial objective function
W = –D – Mt1 .
x1 x2 x3 s1 s2 t1 W
⎡600 500 1000 –1 0 1 0 3000 ⎤
⎢ ⎥
⎢500 100 1000 0 1 0 0 2000 ⎥
⎢ 1 2 1 0 0 M 1 0⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 W
t1 ⎡ 600 500 1000 –1 0 1 0 3000 ⎤ 3
⎢ ⎥
s2 ⎢ 500 100 1000 0 1 0 0 2000 ⎥ 2
W ⎢1 – 600M 2 – 500 M 1 –1000 M M 0 0 1 –3000M ⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 W
t1 ⎡ 100 400 0 −1 1 1 0 1000 ⎤ 2.5
⎢ ⎥
x3 ⎢ 0.5 0.1 1 0 0.001 0 0 2 ⎥ 20
W ⎢ 0.5 –100M 1.9 – 400 M 0 M –0.001 + M 0 1 −2 − 1000M ⎥
⎣ ⎦
x1 x2 x3 s1 s2 t1 W
x2 ⎡ 0.25 1 0 –0.0025 –0.0025 0.0025 0 2.5⎤
⎢ ⎥
x3 ⎢ 0.475 0 1 0.00025 0.00125 –0.00025 0 1.75⎥
W ⎢ 0.025 0 0 0.00475 0.00375 –0.00475 + M 1 –6.75⎥
⎣ ⎦
The minimum value of D is 6.75 when x1 = 0, x2 = 2.5, and x3 = 1.75.
The patient should get 0 ounces of drug A, 2.5 ounces of drug B, and 1.75 minutes of radiation.

3. Answers may vary.

302
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.