0% found this document useful (0 votes)
7 views10 pages

Assignment

The document contains partial answers to selected problems from chapters 1 and 2, including various mathematical optimizations and constraints. Each problem is presented with its respective variables, objective functions, and optimal solutions. Figures referenced in the text illustrate the relationships and constraints for some of the problems.

Uploaded by

sarwaryousaf71
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views10 pages

Assignment

The document contains partial answers to selected problems from chapters 1 and 2, including various mathematical optimizations and constraints. Each problem is presented with its respective variables, objective functions, and optimal solutions. Figures referenced in the text illustrate the relationships and constraints for some of the problems.

Uploaded by

sarwaryousaf71
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

This page intentionally left blank

Appendix B

partial Answers to Selected


problems1

Chapter 1

1-4. (b) 19 minutes.


1-10. (b) Exactly once.
1-11. 15 drops.

Chapter 2

2-1. (a) -x1 + x2 Ú 1.


(c) x2 - x1 … 0.
(e) .5x1 - .5x2 … 0.
2-3. Unused 1M1 = 10, M2 = 12 tons/day.
2-5. (a and e) See Figure B.1.
2-6. (a and d) See Figure B.2.

x1 (a) Figure B.1 x2 Figure B.2

6 3
(e)
(d) (a)
4 2

2 1

22 0 2 4 x2 21 0 1 2 x1

1
Solved problems in this appendix are designated by * in the text.

797
2-9. Let
x1 = Number of units of A
x2 = Number of units of B
Maximize z = 40x1 + 90x2 subject to
-.2x1 + .8x2 … 0, 2x1 + 4x2 … 300,
x1 … 110, x1, x2 Ú 0
Optimum: 1x1, x2 2 = 1100, 252, z = $6,250.
2-11. Let
x1 = Dollars invested in A
x2 = Dollars invested in B
Maximize z = .05x1 + .08x2 subject to
.75x1 - .25x2 Ú 0, .5x1 - .5x2 Ú 0
x1 - .5x2 Ú 0, x1 + x2 … 5000, x1, x2 Ú 0
Optimum: 1x1, x2 2 = 12500, 25002, z = $325
2-18. Let
x1 = Tons of C1 per hour
x2 = Tons of C2 per hour
Maximize z = 12000x1 + 9000x2 subject to
-200x1 + 100x2 … 0, 2.1x1 + .9x2 … 20, x1, x2 Ú 0
Optimum: 1x1, x2 2 = 15.13, 10.262, z = 153, 846 lb
(a) Optimum ratio C1:C2 = .5.
(b) Optimum ratio is the same, but steam generation will increase by 7692 lb/hr.
2-22. Let
x1 = Number of HiFi1 units
x2 = Number of HiFi2 units
Minimize z = 1267.2 - 115x1 + 15x2 2 subject to
6x1 + 4x2 … 432, 5x1 + 5x2 … 412.8
4x1 + 6x2 … 422.4, x1, x2 Ú 0
Optimum: 1x1, x2 2 = 150.88, 31, 682, z = 31.68 idle min.
2-28. (a) See Figure B.3.
2-32. Let
x1 = Thousand bbl>day from Iran
x2 = Thousand bbl>day from Dubai
Figure B.3
x2

8
5
2
2x
2
1
4x
z5
2 x1

24

Minimize z = x1 + x2 subject to

-.6x1 + .4x2 … 0, .2x1 + .1x2 Ú 14


.25x1 + .6x2 Ú 30, .1x1 + .15x2 Ú 10
.15x1 + .1x2 Ú 8, x1, x2 Ú 0

Optimum: x1 = 55, x2 = 30, z = 85


2-34. Let

x1 = Ratio of scrap A alloy


x2 = Ratio of scrap B alloy

Minimize z = 100x1 + 80x2 subject to

.03 … .06x1 + .03x2 … .06, .03 … .03x1 + .06x2 … .05


.03 … .04x1 + .03x2 … .07, x1 + x2 = 1, x1, x2 Ú 0

Optimum: x1 = .33, x2 = .67, z = $86,667


2-41. Let

xi = Dollars invested in project i, i = 1, 2, 3, 4


yj = Dollars invested in bank in year j, j = 1, 2, 3, 4

Maximize z = y5 subject to

x1 + x2 + x4 + y1 … 10, 000
.5x1 + .6x2 - x3 + .4x4 + 1.065y1 - y2 = 0
.3x1 + .2x2 + .8x3 + .6x4 + 1.065y2 - y3 = 0
1.8x1 + 1.5x2 + 1.9x3 + 1.8x4 + 1.065y3 - y4 = 0
1.2x1 + 1.3x2 + .8x3 + .95x4 + 1.065y4 - y5 = 0
x1, x2, x3, x4, y1, y2, y3, y4, y5 Ú 0
Optimum solution:
x1 = 0, x2 = $10,000, x3 = $6000, x4 = 0
y1 = 0, y2 = 0, y3 = $6800, y4 = $33,642
z = $53,628.73 at the start of year 5

2-44. Let xiA = Amount invested in year i using plan A, i = 1, 2, 3


xiB = Amount invested in year i using plan B, i = 1, 2, 3
Maximize z = 3x2B + 1.7x3A subject to
x1A + x1B … 100 1start of year 12
-1.7x1A + x2A + x2B = 0 1start of year 22
-3x1B - 1.7x2A + x3A = 0 1start of year 32
xiA, xiB Ú 0, i = 1, 2, 3
Optimum solution: Invest $100, 000 in plan A in year 1 and $170, 000 in plan B
in year 2, z = $510. Problem has alternative optima.
2-49. Let xj = Number of units of product j, j = 1, 2, 3
Maximize z = 30x1 + 20x2 + 50x3 subject to
2x1 + 3x2 + 5x3 … 4000
4x1 + 2x2 + 7x3 … 6000
x1 + .5x2 + .33x3 … 1500
2x1 - 3x2 = 0
5x2 - 2x3 = 0
x1 Ú 200, x2 Ú 200, x3 Ú 150
x1, x2, x3 Ú 0
Optimum solution: x1 = 324.32, x2 = 216.22, x3 = 540.54, z = $41,081.08
2-53. Let xij = Quantity produced by operation i in month j, i = 1, 2, j = 1, 2, 3
Iij = Entering inventory of operation i in month j, i = 1, 2, j = 1, 2, 3

Minimize z = a 1c1j x1j + c2j x2j + .2I1j + .4I2j 2 subject to


3

j=1

.6x11 … 800, .6x12 … 700, .6x13 … 550


.8x21 … 1000, .8x22 … 850, 8x23 … 700
x1j + I1, j - 1 = x2j + I1j, x2j + I2, j - 1 = dj + I2j, j = 1, 2, 3
I1, 0 = I2, 0 = 0, all variables Ú 0
dj = 500, 450, 600 for j = 1, 2, 3
c1j = 10, 12, 11 for j = 1, 2, 3
c2j = 15, 18, 16 for j = 1, 2, 3
Optimum: x11 = 1333.33 units, x13 = 216.67, x21 = 1250 units, x23 = 300 units,
z = $39,720.
2-55. Let xi 1yi 2 = Number of 8-hr (12-hr) buses starting in period i. Objective func-
tion coefficients 1 and 1.75 are relative cost weights per bus for 8-hr and 12-hr
operations, respectively.

Minimize z = a xi + 1.75 a yi subject to


6 6

i=1 i=1

x1 + x6 + y1 + y5 + y6 Ú 4, x1 + x2 + y1 + y2 + y6 Ú 8,
x2 + x3 + y1 + y2 + y3 Ú 10, x3 + x4 + y2 + y3 + y4 Ú 7
x4 + x5 + y3 + y4 + y5 Ú 12, x5 + x6 + y4 + y5 + y6 Ú 4
All variables are nonnegative
Solution: x1 = 4, x2 = 4, x4 = 2, x5 = 4, y3 = 6, all others = 0.
z = 24.5. Total number of buses = 20. For the case of 8@hr shift,
number of buses = 26 and comparable z = 1 * 26 = 26. Thus, 18@hr + 12@hr2
shift is better.
2-59. Let xi = Number of students starting in period i (i = 1 for 8:01 a.m., i = 9 for
4:01 p.m.)
Minimize z = x1 + x2 + x3 + x4 + x6 + x7 + x8 + x9 subject to
x1 Ú 2, x1 + x2 Ú 2, x1 + x2 + x3 Ú 4,
x2 + x3 + x4 Ú 3, x3 + x4 Ú 3, x4 + x6 Ú 2,
x6 + x7 Ú 2, x6 + x7 + x8 Ú 2, x7 + x8 + x9 Ú 2
x5 = 0, all other variables are nonnegative
Solution: x1 = x3 = 2, x4 = x6 = x7 = x9 = 1, total hired = 8. Problem has
alternative optima.
2-63. Let
xij = Portion of project i completed in year j
Maximize z = .0514x11 + 3x12 + 2x13 2 + .0713x22 + 2x23 + x24 2
+ .1514x31 + 3x32 + 2x33 + x34 2 + .0212x43 + x44 2
subject, to
x11 + x12 + x13 = 1, x43 + x44 = 1
.25 … x22 + x23 + x24 + x25 … 1
.25 … x31 + x32 + x33 + x34 + x35 … 1
5x11 + 15x31 … 3, 5x12 + 8x22 + 15x32 … 6
5x13 + 8x23 + 15x33 + 1.2x43 … 7
8x24 + 15x34 + 1.2x44 … 7, 8x25 + 15x35 … 7
all xij Ú 0
Optimum: x11 = .6, x12 = .4, x24 = .255, x25 = .025, x32 = .267,
x33 = .387, x34 = .346, x43 = 1, z = $523,750
2-68. Let xs = lb of screws/package, xb = lb of bolts/package, xn = lb of nuts/package,
xw = lb of washers/package
Minimize z = 1.2xs + 1.75xb + 1 75
80 2 xn + 1 25
30 2 xw subject to

y = xs + xb + xn + xw
y Ú 1, xs Ú .1y, xb Ú .25y, xn … .15y, xw … .1y
1 101 2 xb … xn, 1 501 2 xb … xw
All variables are nonnegative
Solution: z = $1.26, y = 1, xs = .5, xb = .25, xn = .15, xw = .1.
2-71. Let xA = bbl of crude A/day, xB = bbl of crude B/day, xr = bbl of regular/day
xp = bbl of premium/day, xj = bbl of jet fuel/day
Maximize z = 501xr - sr+ 2 + 701xp - sp+ 2 + 1201xj - sj+ 2
- 110sr- + 15sp- + 20sj- + 2sr+ + 3sp+ + 4sj+ 2
- 130xA + 40xB 2 subject to
xA … 2500, xB … 3000, xr = .2xA + .25xB, xp = .1xA + .3xB, xj = .25xA + .1xB
xr + sr- - sr+ = 500, xp + sp- - sp+ = 700, xj + sj- - sj+ = 400, All variables Ú 0
Solution: z = $21,852.94, xA = 1176.47 bbl>day, xB = 1058.82, xr = 500 bbl>day
xp = 435.29 bbl>day, xj = 400 bbl>day, sp- = 264.71

2-81. |__________ g1__________|y1|_______________________ r1___________________|


|____________ r2___________|_______ g _____________|y |_________r _________|
2 2 2
|_________________________ r _______________________|________ g _______|y |
3 3 3
|____________________________________________ 2.2 minutes_______________|

Let gi, yi, and ri be the durations of green, yellow, and red lights for cars exiting
highway i. All time units are in seconds. No cars move on yellow.
maximize z = 41500>36002g1 + 51650>36002g2 + 61450>36002g3 subject to
1550>36002g1 + 1650>36002g2 + 1450>36002g3 … 1500>36002 12.2 * 60 - 3 * 10
g1 + g2 + g3 + 3 * 10 … 2.2 * 60, g1 Ú 22, g2 Ú 22, g3 Ú 22
Solution: g1 = 22 sec, g2 = 45.1 sec, g3 = 34.9 sec. Booth income = $80.33>hr.
Chapter 3

3-1. 4 tons/day and 0 ton/day for raw materials M1 and M2, respectively.
3-4. Let xij = Units of product i produced on machine j.
Maximize z = 101x11 + x12 2 + 151x21 + x22 2 subject to
x11 + x21 - x12 - x22 + s1 = 5
-x11 - x21 + x12 + x22 + s2 = 5
x11 + x21 + s3 = 200
x12 + x22 + s4 = 250
si, xij Ú 0, for all i and j
3-9. Let xj = Units of product j, j = 1, 2, 3.
Maximize z = 2x1 + 5x2 + 3x3 - 15x 4+ - 10x 5+ subject to
2x1 + x2 + 2x3 + x 4- - x 4+ = 80
x1 + x2 + 2x3 + x 5- - x 5+ = 65
x1, x2, x3, x 4- , x 4+ , x 5- , x 5+ Ú 0
Optimum solution: x2 = 65 units, x 4- = 15 units, all others = 0, z = $325.
96
3-11. (c) x1 = 12 24
7 , x2 = 7 , z = 7 .
(e) Corner points 1x1 = 0, x2 = 62 and 1x1 = 12, x2 = 02 are infeasible.
3-13. Infeasible basic solutions are:
1x1, x2 2 = 1 133, - 23 2 , 1x1, x3 2 = 14, -12
1x1, x4 2 = 13, -22, 1x2, x3 2 = 18, -132
1x2, x4 2 = 1 32, - 1322 , 1x3, x4 2 = 13, -82

3-18. (a) (A, B) and (H, I) can represent successive simplex iterations because associ-
ated corner points are adjacent. The remaining pairs are not adjacent corner
points.
(b) (i) Yes. (ii) No, path returns to a previous corner point, A. (iii) No, C and I
are not adjacent.
3-20. (a) x3 enters at value 1, z = 3 at corner point D.
3-23.
New basic variable x1 x2 x3 x4

Value 3 2 0 1.6
Leaving variable x7 x7 x8 x4

3-26. (b) x2, x5, and x6 can increase value of z. If x2 enters, x8 leaves and ∆z =
5 * 4 = 20. If x5 enters, x1 leaves and ∆z = 0 because x5 equals 0 in the new
solution. If x6 enters, no variable leaves because all the constraint coefficients
of x6 are less than or equal to zero. ∆z = ∞ because x6 can be increased to
infinity without causing infeasibility.
3-29. Second-best value of z = 20 occurs when s2 is made basic.
3-36. (a) Minimize z = 18M - 42x1 + 16M - 12x2 - Ms2 - Ms3 = 10M
(b) Minimize z = 13M - 42x1 + 1M - 12x2 = 3M
3-39. The starting tableau is

Basic x1 x2 x3 x4 Solution

z -1 - 12 0 0 -8

x3 1 1 1 0 4
x4 1 4 0 1 8

3-40. Optimum: x1 = 0, x2 = 7>2, x3 = 0, x4 = 33>2, z = 7.


3-41. Optimum: x1 = 4, x2 = 0, x3 = 2, z = 10.
3-43. Always minimize the sum of artificial variables because the sum represents the
amount of infeasibility in the problem.
3-49. Any nonbasic variable having nonzero objective coefficients at end of Phase I can-
not become positive in Phase II because it will mean that the optimal objective
value in Phase I will be positive, that is, infeasible Phase I solution.
3-51. (a) A S B S C S D.
(b) 1 at A, 1 at B, C 42 = 6 at C, and 1 at D.
3-55. Alternative basic optima: 1 0, 0, 10
3 2 , (0, 5, 0), 1 1, 4, 3 2 . Nonbasic alternative optima:
1

1 a3, 5a2 3 a1 + 3 a3 2 , a1 + a2 + a3 = 1, 0 … ai … 1, i = 1, 2, 3.
+ 4a3, 10 1

3-59. (a) Solution space is unbounded in the direction of x3.


(b) Objective value is unbounded because each unit increase in (unbounded)
x3 increases z by 1.
3-61. The most that can be produced is 550 units.
3-64. Let
x1 = Number of Type 1 hats per day,
x2 = Number of Type 2 hats per day
Maximize z = 8x1 + 5x2 subject to
2x1 + x2 … 400
x1 … 150, x2 … 200
x1, x2 Ú 0
(a) See Figure B.4: x1 = 100, x2 = 200, z = 1800 at point B.
(b) $4 per Type 2 hat in the range (200, 500).
(c) No change because the dual price is $0 per unit in the range 1100, ∞ 2.
(d) $1 worth per unit in the range (100, 400). Maximum increase = 200 Type 2.
c
3-67. (a) 0 … c12 … 2.
c
(b) New c12 = 1. Solution remains unchanged.
x2 Figure B.4
400 F
A 5 (0, 200)
B 5 (100, 200) optimum
300
C 5 (150, 200)
D 5 (150, 100)
B E 5 (150, 0)
A C
200 F 5 (0, 400)

100 D

0 100 E 200 x1

3-69. (a) Yes, because additional revenue per min = $1 (for up to 10 min of over-
time) exceeds additional cost of $.83/min.
(b) Additional revenue is $2>min 1for up to 400 min of overtime2 = $240 for
2 hr. Additional cost for 2 hr = $110. Net revenue = $130.
(c) No, its dual price is zero because the resource is already abundant.
(d) D1 = 10 min. Dual price = $1>min for D1 … 10. x1 = 0, x2 = 105, x3 = 230,
$40
net revenue = 1$1350 + $1 * 10 min2 - 1 60 * 10 min2 = $1353.33.
(e) D2 = -15. Dual price = $2>min for D2 Ú -20. Decrease in revenue = $30.
Decrease in cost = $7.50. Not recommended.
3-73. Let
x1 = radio minutes, x2 = TV minutes, x3 = newspaper ads
Maximize z = x1 + 50x2 + 10x3 subject to
15x1 + 300x2 + 50x3 + s1 = 10, 000, x3 - S2 = 5
x1 + s3 = 400, - x1 + 2x2 + s4 = 0, x1, x2, x3 Ú 0
s1, S2, s3, s4 Ú 0
(a) x1 = 59.09 min, x2 = 29.55 min, x3 = 5 ads, z = 1561.36
(b) From TORA, z + .158s1 + 2.879S2 + 0s3 + 1.364s4 = 156.364. Dual prices
for the respective constraints are .158, -2.879, 0, and 1.36. Lower limit set on
newspaper ads can be decreased because its dual price is negative 1 = -2.8792.
There is no advantage in increasing the upper limit on radio minutes because
its dual price is zero (the present limit is already abundant).
(c) From TORA, x1 = 59.9091 + .00606D1 Ú 0, x3 = 5, x2 = 29.54545 +
.00303D1 Ú 0, s3 = 340.90909 - .00606D1 Ú 0. Thus, dual price = .158 for
the range -9750 … D1 … 56250. A 50% increase in budget 1D1 = $50002
is recommended because the dual price is positive.
3-78. (a) Scarce: resistor and capacitor resource; abundant: chip resource.
(b) Worths per unit of resistor, capacitor, and chips are $1.25, $.25, and $0.
(e) Change D3 = 350 - 800 = -450 falls outside the feasibility range
D3 Ú -400. Hence the problem must be solved anew.

You might also like