Chapter Four: Linear Programming: Modeling Examples

PROBLEM SUMMARY
1. “Product mix” example 32. Blend (maximization)
2. “Diet” example 33. Multiperiod borrowing (minimization)
3. “Investment” example 34. Multiperiod production scheduling
(minimization)
4. “Marketing” example
35. Blend (maximization), sensitivity analysis
5. “Transportation” example
6. “Blend” example 36. Assignment (minimization), sensitivity analysis

7. Product mix (maximization) 37. Transportation (minimization)

8. Sensitivity analysis (4–7) 38. Scheduling (minimization)

9. Diet (minimization) 39. Production line scheduling (maximization)

10. Product mix (minimization) 40. Network flow (minimization)

11. Product mix (maximization) 41. College admissions (maximization)
12. Product mix (maximization) 42. Blend (maximization)
13. Product mix (maximization) 43. Trim loss (minimization)
14. Ingredients mix (minimization) 44. Multiperiod investment (maximization)
15. Transportation (maximization) 45. Multiperiod sales and inventory (maximization)
16. Product mix (maximization)
46. Multiperiod production and inventory
17. Ingredients mix (minimization) (minimization)

18. Crop distribution (maximization) 47. Employee assignment (maximization)

19. Monetary allocation (maximization) 48. Data envelopment analysis

20. Diet (minimization), sensitivity analysis 49. Data envelopment analysis
21. Transportation (maximization) 50. Network flow (maximization)
22. Transportation (minimization) 51. Multiperiod workforce planning (minimization)
23. Warehouse scheduling (minimization) 52. Integer solution (4–43)
24. School busing (minimization)
53. Machine scheduling (maximization), sensitivity
25. Sensitivity analysis (4–24) analysis

26. Ingredients mixture (minimization) 54. Cargo storage (maximization)

27. Interview scheduling (maximization) 55. Broadcast scheduling (maximization)

28. Investments mixture (maximization) 56. Product mix (maximization)
29. Insurance poly mix (maximization) 57. Product mix/advertising (maximization)
30. Product mix (maximization) 58. Scheduling (minimization)
31. Advertising mix (minimization), sensitivity 59. Truck purchasing/leasing (minimization)
analysis

40
60. Multiperiod workforce planning (minimization) 2. With a minimum of 500 calories, the three food
items remain the same, however the amount of
61. Multiperiod workforce (4–50) each and the total cost increases: x3 = 2.995
62. Data envelopment analysis cups of oatmeal, x8 = 1.352 cups of milk, x10 =
1.005 slices of toast, and Z = $0.586.
63. Airline crew scheduling (maximization)
With a minimum of 600 calories, the food
64. Consultant project assignment (minimization) items change to x3 = 4.622 cups of oatmeal and
1.378 cups of milk and Z = $0.683. A change of
65. College admissions (maximization) variables would be expected given that 600
calories is greater than the upper limit of the
66. Product flow/scheduling (minimization)
sensitivity range for calories.
Many different combinations of maximum
PROBLEM SOLUTIONS servings of each of the 10 food items could be
used. As an example limiting the four hot and
1. Since the profit values would change, the cold cereals, x1, x2, x3 and x4 to four cups, eggs
shadow prices would no longer be effective. to three, bacon to three slices, oranges to two,
Also, the sensitivity analysis provided in the milk to two cups, orange juice to four cups and
computer output does not provide ranges for wheat toast to four slices results in the
constraint parameter changes. Thus, the model following solution:
would have to be resolved.
x3 = 2 cups of oatmeal
The reformulated model would have unit costs x4 = 1.464 cups of oat bran
increased by 10 percent. This same amount x5 = .065 eggs
would be subtracted from unit profits. The x8 = 1.033 cups of milk
individual processing times would be reduced x10 = 4 slices of wheat toast
by 10 percent. This would result in a new, Z = $0.828
lower solution of $43,310. Thus, the suggested
alternative should not be implemented. Further limiting the servings of the four hot and
Probably not. The t-shirts are a variable cost cold cereals to two cups, x1 + x2 + x3 + x4 ≤ 2,
and any additional t-shirts purchased by Quik- results in the following solution:
Screen would likely reduce unit profit, which x3 = 2 cups of oatmeal
would change the current shadow price for x6 = .750 slices of bacon
blank t-shirts. The shadow price is effective x8 = 2 cups of milk
only if the profit is based on costs that would be x9 = .115 cups of orange juice
incurred without regard to the acquisition of x10 = 4 slices of wheat toast
additional resources. Z = $0.925
The new requirement is that, 3. It would have no effect; the entire $70,000
x1 = x2 = x3 = x4 would be invested anyway.
Since the upper limit of the sensitivity range for
This can be achieved within the model by
the investment amount is “unlimited,” an
creating three additional constraints,
increase of $10,000 will not affect the shadow
x1 = x2 price, which is $0.074. Thus, the total increase
x1 = x3 in return will be $740 (i.e., $10,000 × .074 =
x1 = x4 $740).

If x1 equals x2, x3 and x4 then x2, x3 and x4 must No, the entire amount will not be invested in
also equal each other. These constraints are one alternative. The new solution is
changed to, x1 = $22,363.636, x3 = $43,636.364, and
x4 = $14,000.
x1 – x2 = 0
4. The shadow price is 1.00, thus for every $1
x1 – x3 = 0
increase in budget, up to the sensitivity range
x1 – x4 = 0
upper limit of $14,000, audience exposure will
The new solution is x1 = x2 = x3 =x4 = 112.5. increase by 1.00. The total audience increase
for a $20,000 budget increase is 20,000.

41
 This new requirement results in two new model Component 1 has the greatest dual price of $20.
constraints, For each barrel of component 1 the company
can acquire, profit will increase by $20, up to
20,000x1 = 12,000x2
the limit of the sensitivity range which is an
20,000x1 = 9,000x3
increase of 1,700 bbls. or 6,200 total bbls. of
or,
component 1. For example an increase of one
20,000 – 12,000x2 = 0 bbl. of component 1 from 4,500 to 4,501 results
20,000x1 – 9,000x3 = 0 in a increase in total cost to $76,820.
The new solution is x1 = 3.068, x2 = 5.114, 7. (a) maximize Z = $190x1 + 170x2 + 155x3
x3 = 6.818 and Z = 184,090. This results in subject to
approximately 61,362 exposures per type of
advertising (with some slight differences due to 3.5x1 + 5.2x2 + 2.8x3 ≤ 500
computer rounding). 1.2x1 + 0.8x2 + 1.5x3 ≤ 240
40x1 + 55x2 + 20x3 ≤ 6,500
5. The slack variables for the three ≤ warehouse x1,x2,x3 ≥ 0
constraints would be added to the constraints as
follows, (b) x1 = 41.27, x2 = 0, x3 = 126.98, Z = $27,523.81
s1 = s2 = 0, s3 = 2,309.52
x1A + x1B + x1C + s1 = 300
x2A + x2B + x2C + s2 = 200 8. (a) It would not affect the model. The slack apples
x3A + x3B + x3C + s3 = 200 are multiplied by the revenue per apple of $.08
to determine the extra total revenue, i.e.,
These three slacks would then be added to the
(2,309.52)($.08) = $184.76.
objective function with the storage cost
coefficients of $9 for s1, $6 for s2 and (b)This change requires a new variable, x4, and
$7 for s3. that the constraint for apples be changed from
This change would not result in a new solution. ≤ to =. No, the Friendly’s should not produce
cider. The new solution would be x1 = 135,
The model must be reformulated with three x2 = 0, x3 = 0, x4 = 18.33 and Z = $26,475.
new variables reflecting the shipments from the This reduction in profit occurs because the
new warehouse at Memphis (4) to the three requirement that all 6,500 apples be used
stores, x4A, x4B, and x4C. These variables must forces resources to be used for cider that would
be included in the objective function with the be more profitable to be used to produce the
cost coefficients of $18, 9 and 12 respectively. other products. If the final model constraint for
A new supply constraint must be added, apples is, ≤ rather than =, the previous solution
x4A + x4B + x4C ≤ 200 in 1(b) results.

The solution to this reformulated model is, 9. (a) x1 = no. of eggs

x2 = no. of bacon strips
x1C = 200 x3 = no. of cups of cereal
x2B = 50
x3A = 150 minimize Z = 4x1 + 3x2 + 2x3
x4B = 200 subject to
Z = 6,550 2x1 + 4x2 + x3 ≥ 16
Yes, the warehouse should be leased. 3x1 + 2x2 + x3 ≥ 12
x1, x2, x3 ≥ 0
The shadow price for the Atlanta warehouse
shows the greatest decrease in cost, $6 for (b)x1 = 2
every additional set supplied from this source. x2 = 3
However, the upper limit of the sensitivity Z = $0.17
range is 200, the same as the current supply
value. Thus, if the supply is increased at 10. (a) xi = number of boats of type i, i = 1 (bass boat),
Atlanta by even one television set the shadow 2 (ski boat), 3 (speed boat)
price will change. In order to break even total revenue must equal
6. This change would not affect the solution at all total cost:
since there is no surplus with any of the three 23,000x1 + 18,000x2 + 26,000x3 = 12,500x1
constraints. + 8,500x2 + 13,700x3 + 2,800,000

42
 or, 13. (a) x1 = no. of lb of Super Two at Fresno
x2 = no. of lb of Super Two at Dearborn
10,500x1 + 9,500x2 + 12,300x3 = 2,800,000
x3 = no. of lb of Green Grow at Fresno
minimize Z = 12,500x1 + 8,500x2 + 13,700x3 x4 = no. of lb of Green Grow at Dearborn
subject to
maximize Z = 7x1 + 5x2 + 5x3 + 4x4
10,500x1 + 9,500x2 + 12,300x3 = 2,800,000 subject to
x1 ≥ 70
x2 ≥ 50 2x1 + 4x2 + 2x3 + 3x4 ≤ 45,000
x3 ≥ 50 x1 + x2 ≤ 6,000
x1 ≤ 120 x3 + x4 ≤ 7,000
x2 ≤ 120 x1 + x3 ≤ 5,000
x3 ≤ 120 x2 + x4 ≤ 6,000
x1, x2, x3 ≥ 0 x1, x2, x3, x4 ≥ 0

(b)x1 = 70.00 (b)x1 = 5,000

x2 = 120.00 x2 = 1,000
x3 = 75.203 x4 = 5,000
Z = $2,925,284.553 Z = $60,000

11. (a) x1 = no. of clocks 14. (a) xi = ore i (i = 1,2,3,4,5,6)

x2 = no. of radios minimize Z = 27x1 + 25x2 + 32x3 + 22x4 +
x3 = no. of toasters 20x5 + 24x6
maximize Z = 8x1 + 10x2 + 7x3 subject to
subject to .19x1 + .43x2 + .17x3 + .20x4 +.12x6 ≥ .21
7x1 + 10x2 + 5x3 ≤ 2,000 .15x1 + .10x2 + .12x4 + .24x5 + .18x6 ≤ .12
2x1 + 3x2 + 2x3 ≤ 660 .12x1 + .25x2 + .10x5 + .16x6 ≤ .07
x1 ≤ 200 .14x1 + .07x2 + .53x3 + .18x4 + 0.31x5 + .25x6 ≥ .30
x2 ≤ 300 .14x1 + .07x2 + .53x3 + .18x4 + .31x5 + .25x6 ≤ .65
x3 ≤ 150 .60x1 + .85x2 + .70x3 + .50x4 + .65x5 + .71x6 = 1.00
x1, x2, x3 ≥ 0
(b)x2 = .1153 ton – ore 2
(b)x1 = 178.571 x3 = .8487 ton – ore 3
x3 = 150.00 x4 = .0806 ton – ore 4
Z = $2,478.571 x5 = .4116 ton – ore 5
Z = $40.05

12. (a) x1 = no. of gallons of Yodel

x2 = no. of gallons of Shotz 15. (a) xij = number of trucks assigned to route from
x3 = no. of gallons of Rainwater warehouse i to terminal j, where i = 1
(Charlotte), 2 (Memphis), 3 (Louisville) and
maximize Z = 1.50x1 + 1.60x2 + 1.25x3 j = a (St. Louis), b (Atlanta), c (New York)
subject to
maximize Z = 1.800x1a + 2,100x1b + 1,600x1c
x1 + x2 + x3 = 1,000 + 1,000x2a + 700x2b + 900x2c + 1,400x3a
1.50x1 + .90x2 + .50x3 ≤ 2,000 + 800x3b + 2,200x3c
x1 ≤ 400
x2 ≤ 500 subject to
x3 ≤ 300 x1a + x1b + x1c = 30
x1, x2, x3 ≥ 0 x2a + x2b + x2c = 30
x3a + x3b + x3c = 30
(b)x1 = 400 x1a + x2a + x3a ≤ 40
x2 = 500 x1b + x2b + x3b ≤ 60
x3 = 100 x1c + x2c + x3c ≤ 50
Z = $1,525.00 x ij ≥ 0

43
 (b)x1b = 30 subject to
x2a = 30 xc1 + xp1 + xs1 ≥ 300
x3c = 30 xc1 + xp1 + xs1 ≤ 500
Z = $159,000 xc2 + xp2 + xs2 ≥480
xc2 + xp2 + xs2 ≤ 800
16. (a)x1 = no. of sofas xc3 + xp3 + xs3 ≥420
x2 = no. of tables xc3 + xp3 + xs3 ≤ 700
x3 = no. of chairs xc1 + xc2 + xc3 ≤ 900
xp1 + xp2 + xp3 ≤ 700
maximize Z = 400x1 + 275x2 + 190x3 xs1 + xs2 + xs3 ≤ 1,000
subject to 800(xc1 + xp1 + xs1) –
7x1 + 5x2 + 4x3 ≤ 2,250 500(xc2 + xp2 + xs2) = 0
12x1 + 7x3 ≤ 1,000 700(xc2 + xp2 + xs2) –
6x1 + 9x2 + 5x3 ≤ 240 800(xc3 + xp3 + xs3) = 0
x1 + x2 + x3 ≤ 650 700(xc1 + xp1 + xs1) –
x1, x2, x3 ≥ 0 500(xc3 + xp3 + xs3) = 0
xij ≥ 0
(b)x1 = 40
Z = $16,000 (b)xc1 = 500
xc2 = 100
17. (a) xij = lbs. of seed i used in mix j, where i = t xc3 = 300
(tall fescue), m (mustang fescue), b (bluegrass) xp2 = 700
and j = 1,2,3. xs3 = 400
Z = $975,000
minimize Z = 1.70 (xt1 + xt2 + xt3) + 2.80
(xm1 + xm2 + xm3) + 3.25 (xb1 + xb2 + xb3) 19. (a) x1 = $ allocated to job training
subject to x2 = $ allocated to parks
.50xt1 –- .50xm1 – .50xb1 ≤ 0 x3 = $ allocated to sanitation
–.20xt1 + .80xm1 – .20xb1 ≥ 0 x4 = $ allocated to library
–.30xt2 – .30xm2 + .70xb2 ≥ 0 maximize Z = .02x1 + .09x2 + .06x3 + .04x4
–.30xt2 + .70xm2 – .30xb2 ≥ 0 subject to
.80xt2 – .20xm2 – .20xb2 ≤ 0
.50xt3 – .50xm3 – .50xb3 ≥ 0 x1 + x2 + x3 + x4 = 4,000,000
.30xt3 – .70xm3 – .70xb3 ≤ 0 x1 ≤ 1,600,000
–.10xt3 – .10xm3 + .90xb3 ≥ 0 x2 ≤ 1,600,000
xt1 + xm1 + xb1 ≥ 1,200 x3 ≤ 1,600,000
xt2 + xm2 + xb2 ≥ 900 x4 ≤ 1,600,000
xt3 + xm3 + xb3 ≥ 2,400 x2 – x3 – x4 ≤ 0
xij ≥ 0 x1 – x3 ≥ 0
x1, x2, x3, x4 ≥ 0
(b)xt1 = 600
xt2 = 180 (b) x1 = 800,000
xt3 = 1,680 x2 = 1,600,000
xm1 = 600 x3 = 800,000
xm2 = 450 x4 = 800,000
xm3 = 480 Z = 240,000
xb1 = 0
xb2 = 270 20. (a) minimize Z = .80x1 + 3.70x2 + 2.30x3 + .90x4
xb3 = 240 + .75x5 + .40x6 + .83x7
Z = $10,123.50 subject to
520x1 + 500x2 + 860x3 + 600x4 +
18. (a) xij = acres of crop i planted on plot j, where 50x5 + 460x6 + 240x7 ≥ 1,500
i = c (corn), p (peas), s (soybeans) and j = 1,2,3 520x1 + 500x2 + 860x3 + 600x4 +
maximize Z = 600(xc1 + xc2 + xc3) 50x5 + 460x6 + 240x7 ≤ 2,000
+ 450(xp1 + xp2 + xp3) 4.4x1 + 3.3x2 + .3x3 + 3.4x4 +
+ 300(xs1 + xs2 + xs3) .5x5 + 2.2x6 + .2x7 ≥ 5

44
 30x1 + 5x2 + 75x3 + 3x4 + 10x7 ≥ 20 Ash: .03x11 – .01x21 – .02x31 ≤ 0
30x1 + 5x2 + 75x3 + 3x4 + 10x7 ≤ 60 .04x12 – .0x22 – .01x32 ≤ 0
17x1 + 85x2 + 82x3 + 10x4 + .04x13 – .0x23 – .01x33 ≤ 0
6x5 + 10x6 + 16x7 ≥ 30 .03x14 – .01x24 – .02x34 ≤ 0
30x4 + 70x6 + 22x7 ≥ 40
180x1 + 90x2 + 350x3 + 20x7 ≤ 30 Sulfur: .01x11 – .01x21 – .02x31 ≤ 0
xi ≥ 0 .01x12 + .01x22 – .02x32 ≤ 0
–.01x13 + .03x23 – .04x33 ≤ 0
(b)x4 = 1.667 .0x14 – .02x24 – .03x34 ≤ 0
x6 = 0.304 xij ≥ 0
x7 = 1.500
Z = $2.867 (b) x11 = 42
x13 = 18
(c) The model becomes infeasible and cannot be x14 = 72
solved. Limiting each food item to one-half x21 = 10
pound is too restrictive. In fact, x22 = 160
experimentation with the model will show that x31 = 58
one food item in particular, dried beans, is x33 = 72
restrictive. All other food items can be limited x34 = 108
except dried beans. Z = $41,726

21. (a) xij = number of units of products i (i = 1,2,3)

produced on machine j (j = 1,2,3,4) 23. (a) xij = space (ft2) rented in month i for j months,
maximize Z = $7.8x11 + 7.8x12 + 8.2x13 + where i = 1,2...,6, and j = 1,2,...,6
7.9x14 + 6.7x21 + 8.9x22 + 9.2x23 + 6.3x24 + Minimize Z = 1.70x11 + 1.40x12 + 1.20x13 +
8.4x31 + 8.1x32 + 9.0x33 + 5.8x34 1.10x14 + 1.05x15 + 1.00x16 + 1.70x21 +
subject to 1.40x22 + 1.20x23 + 1.10x24 + 1.05x25 +
1.70x31 + 1.40x32 + 1.20x33 + 1.10x34 +
35x11 + 40x21 + 38x31 ≤ 9,000 1.70x41 + 1.40x42 + 1.20x43 + 1.70x51 +
41x12 + 36x22 + 37x32 ≤ 14,400 1.40x52 + 1.70x61
34x13 + 32x23 + 33x33 ≤ 12,000
39x14 + 43x24 + 40x34 ≤ 15,000 subject to:
x11 + x12 + x13 + x14 = 400 x11 + x12 + x13 + x14 + x15 + x16 = 47,000
x21 + x22 + x23 + x24 = 570 x12 + x13 + x14 + x15 + x16 + x22 + x23
x31 + x32 + x33 + x34 = 320 + x24 + x25 = 35,000
xij ≥ 0 x13 + x14 + x15 + x16 + x22 + x23 + x24
+ x25 + x31 + x32 + x33 + x34 = 52,000
(b)x11 = 15.385 x14 + x15 + x16 + x23 + x24 + x25 + x32
x14 = 384.615 + x33 + x34 + x41 + x42 + x43 = 27,000
x22 = 400.00 x15 + x16 + x24 + x25 + x33 + x34 + x42
x23 = 170.00 + x43 + x51 + x52 = 19,000
x31 = 121.212 x16 + x25 + x34 + x43 + x52 + x61 = 15,000
x33 = 198.788
Z = $11,089.73 (b)x11 = 12,000
x13 = 25,000
22. (a) Minimize Z = 69x11 + 71x12 + 72x13 + 74x14 + x14 = 8,000
76x21 + 74x22 + 75x23 + 79x24 + 86x31 + 89x32 x15 = 2,000
+ 80x33 + 82x34 x33 = 2,000
subject to x34 = 15,000
x11 + x12 + x13 + x14 ≤ 220 Z = $80,200
x21 + x22 + x23 + x24 ≤ 170
x31 + x32 + x33 + x34 ≤ 280 (c)x16 = 52,000
x11 + x21 + x31 = 110 Z = $52,000
x12 + x22 + x32 = 160 It is much cheaper to rent all the space for the
x13 + x23 + x33 = 90 entire six month period in April and have
x14 + x24 + x34 = 180 excess or “surplus” space.

45
24. (a) xij = no. of students bused from district i to 26. (a) x1 = no. of lb of oats
school j, where i = n, s, e, w, c and j = c,w,s x2 = no. of lb of corn
x3 = no. of lb of soybean
minimize Z = 8xnc + 11xnw + 14xns + 12xsc +
x4 = no. of lb of vitamin supplement
9xsw + 0xss + 9xec + 16xew +
10xes + 8xwc + 0xww + 9xws + minimize Z = .50x1 + 1.20x2 + .60x3 + 2.00x4
0xcc + 8xcw + 12xcs subject to
subject to
x1 ≤ 300
xnc + xnw + xns = 700
x2 ≤ 400
xsc + xsw + xss = 300
x3 ≤ 200
xec + xew + xes = 900
x4 ≤ 100
xwc + xww + xws = 600
x3/(x1 + x2 + x3 + x4) ≥ .30
xcc + xcw + xsc = 500
x4/(x1 + x2 + x3 + x4) ≥ .20
xnc + xsc + xec + xwc + xcc ≤ 1,200
x2/x1 ≤ 2/1
xnw + xsw + xew + xww + xcw ≤ 1,200
x1 ≤ x3
xns + xss + xes + xws + xcs ≤ 1,200
x1 + x2 + x3 + x4 ≥ 500
xij ≥ 0
x1, x2, x3, x4 ≥ 0
(b)xnc = 700
xss = 300 (b) x1 = 200
xes = 900 x2 = 0
xww = 600 x3 = 200
xcc = 500 x4 = 100.00
Z = 14, 600 Z = $420

25. (a) Add the following 3 constraints to the original 27. (a) x1 = no. of day contacts by phone
formulation: x2 = no. of day contacts in person
xss ≤ 150 x3 = no. of night contacts by phone
xww ≤ 300 x4 = no. of night contacts in person
xcc ≤ 250 maximize Z = 2x1 + 4x2 + 3x3 + 7x4
xnc = 700 subject to
xnw = 0 x2 + x4 ≤ 300
xsw = 150 6x1 + 15x2 ≤ 1,200
xss = 150 5x3 + 12x4 ≤ 2,400
xes = 900 x1, x2, x3, x4 ≥ 0
xwc = 250
xww = 300
xws = 50 (b) x1 = 200
xcc = 250 x3 = 480
xcw = 250 Z = 1,840
Z = 20,400
28. (a) xij = dollar amount invested in alternative i in
(b)Change the 3 demand constraints in the year j, where i = p (product research and
(a) formulation from ≤ 1,200 to = 1,000. development), m (manufacturing operations
xnc = 400 improvements), a (advertising and sales
xnw = 300 promotion) and j = 1,2,3,4 (denoting year):
xsw = 150 sj = slack, or uninvested funds in year j
xss = 150 maximize Z = s4 + 1.2xa4 + 1.3xm3 + 1.5xp3
xec = 50 subject to
xes = 850 xa1 ≥ 30,000
xwc = 300 xm1 ≥ 40,000
xww = 300 xp1 ≥ 50,000
xcc = 250 xa1 + xm1 + xp1 + s1 = 500,000
xcw = 250 xa2 + xm2 + xp2 + s2 = s1 + 1.2xa1
Z = 21,200

46
 xa3 + xm3 + xs3 = s2 + 1.2xa2 + 1.3xm1 subject to
xa4 + xs4 = s3 + 1.2xa3 + 1.3xm2 + x3/x2 ≥ 2/1
1.5xp1 25,000x1 + 10,000x2 + 15,000x3 ≥ 100,000
xij, sj ≥ 0 (15,000x1 + 3,000x2 + 12,000x3)/
Note: Since it is assumed that any amount of (10,000x1 + 7,000x2 + 3,000x3) ≥ 2/1
funds can be invested in each alternative— i.e., (15,000x1 + 4,000x2 + 9,000x3)/
there is no minimum investment required—and (25,000x1 + 10,000x2 + 15,000x3) ≥ .30
funds can always be invested in as short a x2 ≤ 7
period as one year yielding a positive return, it x1, x2, x3 ≥ 0
is apparent that the sj variables for uninvested (b)x2 = 2.5
funds will be driven to zero in every period. x3 = 5.0
Thus, these variables could be omitted from the Z = 40,000
model formulation for this problem. (c) This reformulation of the model would result
in a fourth variable x4, with model parameters
(b)xa1 = 410,000 xm1 = 40,000 inserted accordingly. However, it would have
xa2 = 492,000 xp1 = 50,000 no effect on the solution.
xa3 = 642,400 Z = $1,015,056
xa4 = 845,880 32. (a) xij = lbs. of coffee i used in blend j per week,
where i = b (Brazilian), o (Mocha), c
29. (a) x1 = no. of homeowner's policies (Colombian), m (mild) and j = s (special), d
x2 = no. of auto policies (dark), r (regular)
x3 = no. of life policies
maximize Z = 4.5xbs + 3.75xos + 3.60xcs
maximize Z = 35x1 + 20x2 + 58x3 + 4.8xms + 3.25xbd + 2.5xod +
subject to 2.35xcd + 3.55xmd + 1.75xbr +
1.00xor + 0.85xcr + 2.05xmr
14x1 + 12x2 + 35x3 ≤ 35,000
subject to
6x1 + 3x2 + 12x3 ≤ 20,000
x1, x2, x3 ≥ 0 . 6xcs – .4xbs – .4xos – .4xms ≥ 0
–.3xbs + .7xos – .3xcs – .3xms ≥ 0
(b)x1 = 2,500 .4xbd – .6xod – .6xcd – .6xmd ≥ 0
Z = $87,500 –.1 xbd – .1xod – .1xcd + .9xmd ≤ 0
–.6xbr – .6xor – .6xcr + .4xmr ≤ 0
30. (a) x1 = no. of issues of Daily Life .7xbr – .3xor – .3xcr – .3xmr ≥ 0
x2 = no. of issues of Agriculture Today xbs + xbd + xbr ≤ 110
x3 = no. of issues of Surf’s Up xos + xod + xor ≤ 70
maximize Z = 2.25x1 + 4.00x2 + 1.50x3 xcs + xcd + xcr ≤ 80
subject to xms + xmd + xmr ≤ 150
xij ≥ 0
x1 + x2 + x3 ≥ 5,000
.01x1 + .03x2 + .02x3 ≤ 120 (b) xos = 60 Special: xos + xcs + xms = 200lbs.
.2x1 + .5x2 + .3x3 ≤ 3,000 xcs = 80 Dark: xbd + xmd = 72 lbs.
x1 ≤ 3,000 xms = 60 Regular: xbr + xor + xmr = 138 lbs.
x2 ≤ 2,000 xbd = 64.8
x3 ≤ 6,000 xmd = 7.2
x1, x2, x3 ≥ 0 xbr = 45.2
xor = 10
xmr = 82.8
(b)x1 = 3,000 Z = $1,296
x2 = 2,000
x3 = 1,500
33. (a) x1 = $ amount borrowed for six months in July
Z = $17,000
yi = $ amount borrowed in month i (i = 1, 2, ...,
6) for one month
31. (a) x1 = no. of television commercials ci = $ amount carried over from month i to i + 1
x2 = no. of newspaper ads
6
x3 = no. of radio commercials
minimize Z = .11x1 + .05∑ yi
i =1
minimize Z = 15,000x1 + 4,000x2 + 6,000x3

47
 subject to (b)x14 = 20 y5 = 5
x44 = 40 y6 = 10
July: x1 + y1 + 20,000 – c1 = 60,000
x35 = 20 y7 = 20
August: c1 + y2 + 30,000 – c2 = 60,000 + y1
x55 = 60 Z = $31,500
September: c2 + y3 + 40,000 – c3 = 80,000 + y2
x66 = 90
October: c3 + y4 + 50,000 – c4 = 30,000 + y3
x17 = 10
November c4 + y5 + 80,000 – c5 = 30,000 + y4
x27 = 30
December: c5 + y6 + 100,000 – c6 = 20,000 + y5
x37 = 0
End: x1 + y6 ≤ c6
x77 = 50
x1, yi, ci ≥ 0
(b) Solution Production for Month j
x1 = 70,000 Month i Capacity 4 5 6 7 Capacity
y3 = 40,000 1 30 20 10 30
y4 = 20,000 2 30 30 30
y1 = y2 = y5 = y6 = 0 3 30 20 10 30
c1 = 30,000
4 40 40 40
c5 = 30,000
c6 = 110,000 5 60 60 60
Z = $10,700 6 90 90 90
7 50 50 50
(c) Changing the six-month interest rate to 9%
results in the following new solution: Overtime — 5 10 20
x1 = 90,000 Demand 60 85 100 120
y3 = 20,000
c1 = 50,000
(c) x34 = 20
c2 = 20,000
x44 = 40
c5 = 50,000
x25 = 5
c6 = 130,000
x35 = 20
Z = $9,100
x55 = 60
x26 = 10
34. (a) xij = production in month i to meet demand in
x66 = 90
month j, where i = 1,2,... 7 and j = 4,5,6 and 7
x17 = 40
yj = overtime production in month j where
x27 = 25
j = 4,5,6,7.
x77 = 50
Minimize Z = 150x14 + 100x24 + 50x34 + y7 = 5
200x15 + 150x25 + 100x35 + 250x16 + 200x26 + Z = $26,000
150x36 + 300x17 + 250x27 + 200x37 + 400y4 +
400y5 + 400y6 + 400y7 35. (a) xij = amount of ingredient i in wiener type j,
where i = c, b, p, a represent chicken, beef,
Subject to pork, and additives, and j = r,b,m represent
x14 + x24 + x34 + x44 + y4 = 60 regular, beef, and all-meat, respectively
x15 + x25 + x35 + x55 + y5 = 85 maximize Z = .7xcr + .6xbr + .4xpr + .85xar
x16 + x26 + x36 + x66 + y6 = 100 + 1.05 xcb + .95xbb + .75xpb
x17 + x27 + x37 + x77 + y7 = 120 + 1.20xab + 1.55xcm + 1.45xbm
x14 + x15 + x16 + x17 ≤ 30 + 1.25xpm + 1.70xam
x24 + x25 + x26 + x27 ≤ 30
x34 + x35 + x36 + x37 ≤ 30 subject to
x44 ≤ 40 xcr + xcb + xcm ≤ 200
x55 ≤ 60 xbr + xbb + xbm ≤ 300
x66 ≤ 90 xpr + xpb + xpm ≤ 150
x77 ≤ 50 xar + xab + xam ≤ 400
y4 ≤ 20 .90xbr + .90xpr – .l0xcr – l0xar ≤ 0
y5 ≤ 20 .80xcr –.20xbr – .20xpr – .20xar ≥ 0
y6 ≤ 20 .25xbb – .75xcb – .75xpb – .75xab ≥ 0
y7 ≤ 20 *xam = 0

48
 .5xbm + .5xpm – .5xcm – .5xam ≤ 0 The new solution is x2 = 1, x9 = 1, x10 = 1,
xij ≥ 0 Z = 56. Joe should hire Kelly.
*Also feasible to delete xam from the problem.
37. (a) This is a transportation problem.
x1 = no. of tons of carpet shipped from
(b) xcr = 75 xar = 300
St. Louis to Chicago
xcm = 125 xab = 100
x2 = no. of tons of carpet shipped from
xbb = 300
St. Louis to Atlanta
xpm = 1250
x3 = no. of tons of carpet shipped from
Z = $1,062.50
Richmond to Chicago
x4 = no. of tons of carpet shipped from
36. (a) This is an assignment problem. Richmond to Atlanta
x1 = operator 1 to drill press minimize Z = 40x1 + 65x2 + 70x3 + 30x4
x2 = operator 1 to lathe subject to
x3 = operator 1 to grinder
x4 = operator 2 to drill press x1 + x2 = 250
x5 = operator 2 to lathe x3 + x4 = 400
x6 = operator 2 to grinder x1 + x3 = 300
x7 = operator 3 to drill press x2 + x4 = 350
x8 = operator 3 to lathe x1, x2, x3, x4 ≥ 0
x9 = operator 3 to grinder
(b)x1 = 250
minimize Z = 22x1 + 18x2 + 35x3 + 41x4 x3 = 50
+ 30x5 + 28x6 + 25x7 + 36x8 x4 = 350
+ 18x9 Z = 24,000
subject to
x1 + x2 + x3 = 1 38. (a) xi = number of nurses that begin the 8-hour
x4 + x5 + x6 = 1 shift in period i, where i = 1,2,...12 and period 1
x7 + x8 + x9 = 1 = 12 AM–2 AM, period 2 = 2AM–4AM, etc.
x1 + x4 + x7 = 1 minimize Z = x1 + x2 + x3 + x4 + x5 + x6 + x7
x2 + x5 + x8 = 1 + x8 + x9 + x10 + x11 + x12
x3 + x6 + x9 =1 subject to
x1, x2, x3, x4, x5, x6, x7, x8, x9 ≥ 0
x10 + x11 + x12 + x1 ≥ 30
(b)x1 = 1 x11 + x12 + x1 + x2 ≥ 20
x5 = 1 x12 + x1 + x2 +x3 ≥ 40
x9 = 1 x1 + x2 + x3 + x4 ≥ 50
Z = 70 x2 + x3 + x4 + x5 ≥ 60
x3 + x4 + x5 + x6 ≥ 80
(c) This would require the model to be x4 + x5 + x6 + x7 ≥ 80
reformulated with three new variables, x10, x11, x5 + x6 + x7 + x8 ≥ 70
x12, representing Kelly’s assignment to the x6 + x7 + x8 + x9 ≥70
press, lathe, and grinder. The model would be x7 + x8 + x9 + x10 ≥ 60
reformulated as, x8 + x9 + x10 + x11 ≥ 50
Minimize Z = 22x1 + 18x2 + 35x3 +41x4 + 30x5 x9 + x10 + x11 + x12 ≥ 50
+ 28x6 + 25x7 + 36x8 + 18x9 + xij ≥ 0
20x10 + 20x11 +20x12
subject to (b)x1 = 30
x1 + x2 + x3 ≤ 1 x3 = 10
x4 + x5 + x6 ≤ 1 x4 = 10
x7 + x8 + x9 ≤ 1 x5 = 40
x10 + x11 + x12 ≤ 1 x6 = 20
x1 + x4 + x7 + x10 = 1 x7 = 10
x2 + x5 + x8 + x11 = 1 x9 = 40
x3 + x6 + x9 + x12 = 1 x10 = 10
xi ≥ 0 Z = 170

49
39. (a) x1 = no. of hours molding y4 (out-of-state Business) = 469
x2 = no. of hours smoothing y5 (out-of-state Engineering) = 606
x3 = no. of hours painting y6 (out-of-state Human Resources) = 0
maximize Z = 175(7x1) = 1,225x1 Z = $59,905,095
subject to
41. (a) x13 = tons shipped from 1 to 3
8x1 + 5x2 + 6.5x3 ≤ 3,000 x14 = tons shipped from 1 to 4
x1 + x2 + x3 ≤ 120 x12 = tons shipped from 1 to 2
90(7x1) ≤ 10,000 x34 = tons shipped from 3 to 4
7x1 – 12x2 = 10x3 7x1 – 12x2 = 0 x45 = tons shipped from 4 to 5
(The no. of units going 12x2 – 10x3 = 0 x25 = tons shipped from 2 to 5
through each process 7x1 – 10x3 = 0
must be equal. More x1, x2, x3 ≥ 0 minimize Z = 3x13 + 4x14 + 5x12 + 2x34
bathtubs cannot be + 7x45 + 8x25
smoothed than are first subject to
molded.) x13 + x14 + x12 = 5
x45 + x25 = 5
(b)x1 = 15.87 hours x13 = x34
x2 = 9.26 hours x14 + x34 = x45
x3 = 11.11 hours x12 = x25
Z = 19,444.44 x13, x14, x12, x34, x45, x25 ≥ 0

40. xi = In-state freshman in college i; i = 1,2, .... 6 (b)x14 = 5

yi = Out-of-state freshmen in college i; i =1,2,.... 6 x45 = 5
Z = $55,000
Maximize Z = 8600 (∑ xi) + 19,200 (∑ yi)
subject to: 42. (a) xij = barrels of component i used in gasoline
x1 + y1 ≤ 820 grade j per day, where i = 1, 2, 3, 4 and j = R
x2 + y2 ≤ 1300 (regular), P (premium), L (low lead)
x3 + y3 ≤ 240 Regular: x1R + x2R + x3R + x4R
x4 + y4 ≤ 820 Premium: x1P + x2P + x3P + x4P
x5 + y5 ≤ 1060 Low lead: x1L + x2L + x3L + x4L
x6 + y6 ≤ 610
maximize Z = 3x1R + 5x2R + 0x3R + 6x4R
Σ SATIi ( xi ) + Σ SATOi ( yi ) + 9x1P + 11x2P + 6x3P + 12x4P
≥ 1150 + x1L + 3x2L – 2x3L + 4x4L
Σxi + Σyi
subject to
Σyi
≤ .47 x1R + x2R + x3R + x4R ≥ 3,000
Σxi + Σyi
x1P + x2P + x3P + x4P ≥ 3,000
xi
≥ .30, i = 1, 2, … 6 x1L + x2L + x3L + x4L ≥ 3,000
xi + yi x1R + x1P + x1L ≤ 5,000
Σ xi + Σ yi ≤ 4, 500 x2R + x2P + x2L ≤ 2,400
xi , yi ≥ 0 x3R + x3P + x3L ≤ 4,000
x4R + x4P + x4L ≤ 1,500
.6x1R – .4x2R – .4x3R – .4x4R ≥ 0
Solution:
-.2x1R + .8x2R – .2x3R – .2x4R ≤ 0
x1 (in-state Architecture) = 201 -.3x1R – . 3x2R + .7x3R – .3x4R ≥ 0
x2 (in-state A&S) = 742 -.4x1P – .4x2P + .6x3P – .4x4P ≥ 0
x3 (in-state Agriculture) = 103 -.5x1L + .5x2L – .5x3L – .5x4L ≤ 0
x4 (in-state Business) = 351 .9x1L – .1x2L – .1x3L – .1x4L ≥ 0
x5 (in-state Engineering) = 454 all xij ≥ 0
x6 (in-state Human Resource) = 446
y1 (out-of-state Architecture) = 269 (b)x1R = 2,000
y2 (out-of-state A&S) = 558 x2R = 100
y3 (out-of-state Agriculture) = 137 x3R = 900

50
 x2P = 2,300 44. (a)
x3P = 3,100
x4P = 1,500 Year Year Year Year Year Year
1 2 3 4 5 6
x1L = 3,000
Z = $71,400 S1 S3 S5

S2 S4
43. (a)First, all possible patterns that contain the
desired lengths must be determined. B1 B4

B2
Pattern
Length (ft) 1 2 3 4 5 6 B3

7 3 2 2 1 0 0 C2
9 0 0 1 2 1 0
R5 R6
10 0 1 0 0 1 2
Total used (ft) 21 24 23 25 19 20

xi = no. of standard-length boards to cut using Si = amount of money invested in stocks at the
pattern i beginning of year i, i = 1,2,3,4,5
Bi = amount of money invested in bonds at the
minimize Z = x1 + x2 + x3 + x4 + x5 + x6
beginning of the year i, i = 1,2,3,4,5
subject to
C2 = amount of money invested in certificates
3x1 + 2x2 + 2x3 + x4 = 700 of deposit in year 2
x3 + 2x4 + x5 = 1,200 Ri = amount of money invested in real estate at
x2 + x5 + 2x6 = 300 the beginning of year i, i = 5,6
xi ≥ 0 Ii = amount of money held idle and not invested
at beginning of year i
(b)x2 = 50 maximize Z = 1.20S5 + 1.40B4 + 1.10R6 + I6
x4 = 600 subject to
x6 = 125
Z = 775 S1 + B1 + I1 = $1, 000, 000
S2 + B2 + C2 − I1 + I 2 = 0
(c)
− 1.20 S1 + S3 + B3 − I2 + I3 = 0
Pattern
− 1.20S2 + S4 − 1.40 B1 +
Length (ft) 1 2 3 4 5 6 B4 − I 3 + I4 = 0
7 3 2 2 1 0 0 −1.20 S3 + S5 − 1.40 B2 +
9 0 0 1 2 1 0
R5 − I 4 + I5 = 0
10 0 1 0 0 1 2
−1.20 S4 = 1.40 B3 − 1.8
80C2 −
Trim loss (ft) 4 1 2 0 6 5 1.10 R5 + R6 − I 5 + I6 = 0
xi = no. of standard-length boards to cut using 5 4

pattern i; coefficients of objective function 0.7∑ Si − 0.3∑ Bi − 0.3C2 −

i =1 i =1
= trim loss using pattern i
6
minimize Z = 4x1 + x2 + 2x3 + 0x4 + 6x5 + 5x6
0.3∑ Ri ≤ 0
subject to i =5

3x1 + 2x2 + 2x3 + x4 ≥ 700 5 4

x3 + 2x4 + x5 ≥ 1,200 −0.25∑ Si − 0.25∑ Bi +
x2 + x5 + 2x6 ≥ 300 i =1 i =1

xi ≥ 0 6
x2 = 300 0.75C2 − 0.25∑ Ri ≥ 0
x4 = 600 i =5

Z = 300
Si , Bi , Ci , Ri , Ii ≥ 0

51
 (b) I1 = 1,000,000 minimize Z = $10(x1 + x2 + x3 + x4 + x5) +
C2 = 1,000,000 15(y1 + y2 + y3 + y4 + y5) + 2(w1
R6 = 1,800,000 + w2 + w3 + w4)
Z = $1,980,000 subject to
xi ≤ 2,000 (i = 1, 2, 3, 4, 5)
45. (a) xi = amount sold in month i yi ≤ 600 (i = 1,2,3,4,5)
yi = amount purchased in month i x1 + y1 – w1 = 1,200
si = amount held in storage in month i (until x2 + y2 + w1 – w2 = 2,100
the beginning of the following month) x3 + y3 + w2 – w3 = 2,400
s0 = amount available at the beginning x4 + y4 + w3 – w4 = 3,000
of month 1 x5 + y5 + w4 = 4,000
4 3
xi, yi, wi ≤ 0
maximize Z = ∑ pi xi − ∑ ci yi
i =1 i =1 (b) x1 = 2,000 y1 = 300 w1 =1,100
x2 = 2,000 y2 = 600 w2 = 1,600
x3 = 2,000 y3 = 600 w3 = 1,800
subject to x4 = 2,000 y4 = 600 w4 = 1,400
x5 = 2,000 y5 = 600
xi ≤ si-1 (sales ≤ amount held in storage from
previous month) Z = $152,300
si = si-1 – xi + yi (ending storage = beginning
storage – 47. (a) xij = employee i assigned to department j,
sales + where i = 1,2,3,4 and j = a (lamps), b
purchases) (sporting goods), c (linen)
si ≤ 10,000 (amount held in storage ≤ storage maximize Z = 130x1a + l50x1b + 90x1c +
capacity) 275x2a + 300x2b + 100x2c +
or 180x3a + 225x3b + 140x3c +
maximize Z = 4x1 + 8x2 + 6x3 + 7x4 – 5y1 200x4a + 120x4b + 160x4c
– 6y2 – 7y3 subject to
subject to x1a + x1b + x1c = 1
x2a + x2b + x2c = 1
s0 = 2,000 x3a + x3b + x3c = 1
x1 ≤ s0 x4a + x4b + x4c = 1
s1 = s0 – x1 + y1 1≤ (x1a + x2a + x3a + x4a) ≤ 2
s1 ≤ 10,000 1≤ (x1b + x2b + x3b + x4b) ≤ 2
x2 ≤ s1 1 ≤ (x1c + x2c + x3c + x4c) ≤ 2
s2 = s1 – x2 + y2 xij ≥ 0
s2 ≤ 10,000
(b) x1a = 1
x3 ≤ s2
x2b = 1
s3 = s2 – x3 + y3
s3 ≤ 10,000 x3b = 1
x4c = 1
x4 ≤ s3
Z = 815
xi, yi, si ≥ 0
(c) xij = employee i assigned to department j,
(b) x1 = 0 y1 = 8,000 s0 =2,000 where i = 1,2,3,4, and j = a (lamps), b
x2 = 10,000 y2 = 10,000 s1 = 10,000 (sporting goods), c (linen)
x4 = 10,000 s2 = 10,000 maximize Z = 130x1a + 150x1b + 90x1c +
s3 = 10,000 275x2a + 300x2b + 100x2c +
Z = $50,000 180x3a + 225x3b + 140x3c +
200x4a + 120x4b + 160x4c
46. (a) xi = regular production in month i, where subject to
i = 1, 2, 3, 4, 5 x1a + x1b + x1c ≤ 1
yi = overtime production in month i, where x2a + x2b + x2c ≤ 1
i = 1,2,3,4,5 x3a + x3b + x3c ≤ 1
wi = units in inventory at end of month i, where x4a + x4b + x4c ≤ 1
i = 1, 2, 3, 4

52
 x1a + x2a + x3a +x4a = 1 150x + y10 = 700 + y11
x1b + x2b + x3b + x4b = 1 150x + y11 ≥ 500
x1c + x2c + x3c + x4c = 1
xi ≥ 0 (b) Z = x = 4.4545 lawyers
x2a = 1 y1 = 18.1818
x3b = 1 y2 = 236.3636
x4c = 1 y3 = 304.5454
Z = 660 y4 = 472.7273
y5 = 440.9091
48. Z values: A =1.000, B = 1.000, C = .6700, y6 = 459.09
D = 1.000 Bank C is inefficient y7 = 377.2727
y8 = 145.4545
49. Z values: A =1.000, B = 1.000, C = 1.000 y9 = 13.6364
all 3 hospitals are relatively inefficient. y10 = 31.8182
y11 = 0
50.(a) xij = amount shipped from city i to city j
maximize Z = xAB + xAC or maximize 52. The original optimal solution has x = 4.4545
Z = xEF + xCF lawyers being hired. To get an “optimal”
subject to integer solution you would have to round either
down to x = 4 or up to x = 5. Adding a new
xAB ≤ 7
constraint, x = 4, to the original model
xAC ≤ 6
formulation results in an infeasible solution so
xBE ≤ 2
rounding down is not possible. Adding the
xBD ≤ 5
constraint, x = 5, instead (i.e., rounding up)
xBC ≤ 10
results in a feasible solution so (by logical
xCD ≤ 3
deduction) it must be optimal. The original
xCF ≤ 9
solution had 168.1818 surplus hours while the
xDE ≤ 4
new integer solution has 1,150 surplus hours, a
xEF ≤ 3
large difference in excess capacity. However,
xAB = xBC + xBD + xBE
increasing the number of lawyers (to 6, for
xAC +xBC = xCD + xCF
example) only increases the surplus so x = 5
xBD + xCD = xDE
has to be the optimal integer solution.
xBE + xDE = xEF
xij ≥ 0 53. (a) y = quantity of assembled product produced
(b) xAB = 6 per day
xAC = 6 x1 = quantity of component 1 produced per day
xBE = 2 x2 = quantity of component 2 produced per day
xBD = 1 x3 = quantity of component 3 produced per day
xBC = 3 maximize Z = y
xCF = 9 subject to
xDE = 1
xEF = 3 y = x1 (Component 1)
Z = 12 y = x2 (Component 2)
y = x3 (Component 3)
51.(a) Minimize Z = x Note: The above constraints reflect the fact that
subject to the quantity of completely assembled product
150x = 650 + y1 cannot exceed the quantities of components 1,
150x + y1 = 450 + y2 2, and 3 produced per day, i.e., no in-process
150x + y2 = 600 + y3 inventory.
150x + y3 = 500 + y4 The time available on one lathe is: 60 min/hr.
150x + y4 = 700 + y5 × 8 hrs/day = 480 min. In order to reflect the
150x + y5 = 650 + y6 availability of two lathes (with the work load
150x + y6 = 750 + y7 shared evenly between them) the total minutes
150x + y7 = 900 + y8 of lathe time available is: 480 min/day/machine
150x + y8 = 800 + y9 × 2 machines = 960 min.
150x + y9 = 650 + y10

53
 Thus, the lathe use/availability constraint is: relaxed such that y ≤ x1, y ≤ x2 and y ≤ x3,
production output would increase:
10x1 + 8x2 + 6x3 ≤ 960 (Lathe Time)
x1 = 43.077
x2 = x3 = y = 29.31
By the same rationale, the press use/
availability constraint (for three presses) is: The best alternative is to remove the machine
balancing requirement. If both requirements are
9x1 + 21x2 + 15x3 ≤ 1440 (Press Time) relaxed the production output is x1 = x2 = x3 =
y = 32.
Assuming that the work loads are shared
equally among the lathes, and similarly for 54. (a) xij = amount of commodity i put into hold j,
presses, the individual machine utilizations, are: where i = b (beef), g (grain) and j = f (fore),
a (aft)
(10x1 + 8x2 + 6x3)/2 = 5x1 + 4x2 + 3x3
(9x1 + 21x2 + 15x3)/3 = 3x1 + 7x2 + 5x3 maximize Z = .35(xbf + xba) + .12(xgf + xga)
subject to
The balance condition is reflected by xbf + xgf ≤ 70,000
specifying that the absolute difference between xba + xga ≤ 90,000
individual machine time consumed (on lathes .2xbf + .4xgf ≤ 30,000
versus presses) must be less than or equal to 60 .2xba + .4xga ≤ 40,000
minutes. xbf + xba ≤ 85,000
xgf + xga ≤ 100,000
|(5x1 + 4x2 + 3x3) – (3x1 + 7x2 + 5x3)| ≤ 60 xij ≤ 0

or, (b) xba = 85,000

xgf = 70,000
|2x1 – 3x2 – 2x3| ≤ 60
xga = 5,000
Absolute value constraint conditions can be Z = 38,750
reflected by:
55. xi = no. of commercial minutes during
2x1 – 3x2 – 2x3 ≤ 60 broadcast segment i, where i = l (local news), n
–2x1 + 3x2 + 2x3 ≤ 60 (national news), s (sports), w (weather)
yi = no. of minutes for broadcast segment i
The model is summarized as follows:
maximize Z = $850xl + 600xn + 750xs + 1000xw
maximize Z = y
subject to subject to
y – x1 = 0 xl + xn + xs + xw = 18
y – x2 = 0 xl + xn + xs + xw + yl + yn + ys + yw = 60
y – x3 = 0 400yl + 100yn + 175ys + 90yw ≤ $9,000
10x1 + 8x2 + 6x3 ≤ 960 10 ≤ yl ≤ 25
9x1 + 21x2 + 15x3 ≤ 1440 5 ≤ yn ≤ 10
2x1 – 3x2 – 2x3 ≤ 60 5 ≤ ys ≤ 10
–2x1 + 3x2 + 2x3 ≤ 60 5 ≤ yw ≤ 10
x1, x2, x3, y ≥ 0 xl ≤ 6
xn ≤ 6
xs ≤ 6
(b) x1 = x2 = x3 = y = 20 xw ≤ 6
xi, yi, ≥ 0
(c) If the machine balancing requirement is
Solution:
relaxed such that the constraints 2x1 – 3x2 – 2x3
xl = 6 yl = 14.44
≤ 60 and –2x1 + 3x2 + 2x3 ≤ 60 are eliminated,
xn = 0 yn = 10
production output would increase:
xs = 6 ys = 7.56
x1 = x2 = x3 = y = 32 xw = 6 yw = 10
Alternatively, if the restriction that there be no Z = $15,600
excess component parts at the end of the day is
Multiple optimal solutions exist.

54
 56. (a) xij = amount (oz) of ingredient i in jar of j, y2 = 1,747.126
where i = cabbage, tomato, onions and j = Z = $14,201.64
chow-chow, tomato
58. (a) xi = no. of employees assigned to time period i,
maximize Z where i = 1,2,...,6 (time period 1 = 12:00
midnight –4:00 A.M.;
 2.25   1.95 
=  ( xcc + xtc + xoc ) +  16  ( xct + xtt + xot ) period 2 = 4:00–8:00 A.M.; etc.)
 16   
minimize Z = x1 + x2 + x3 + x4 + x5 + x6

subject to subject to
x6 + x1 ≥ 90
xcc + xtc + xoc + xct + xtt + xot ≤ (700)(16) x1 + x2 ≥ 215
xcc x2 + x3 ≥ 250
≥ .60
xcc + xtc + xoc x3 + x4 ≥ 65
xtt
≥ .50 ,
xoc
≥ .05 x4 + x5 ≥ 300
xct + xtt + xot xcc + xtc + xoc x5 + x6 ≥ 125
xoc xtc xi ≥ 0
≤ .10 , ≥ .10
xcc + xtc + xoc xcc + xtc + xoc
xot xot (b)x1 = 90
≤ .10 , ≥ .05 x2 = 250
xct + xtt + xot xct + xtt + xot
x3 = 0
xcc + xct ≤ (3000)(16) x4 = 175
xtc + xtt ≤ (350)(16) x5 = 125
xoc + xot ≤ (30)(16) x6 = 0
xcc + xtc + xoc xct Z = 640
≥ 1.3, ≥ .10
xct + xtt + xot xot + xtt + xct 59. (a) xij = consultant i hours assigned to project j;
xij ≥ 0
i = A, ... , F and j = 1, ..., 8
F 8
(b) chow-chow relish tomato relish
Minimize Z = ∑ ∑ (ranking) • x ij
xcc = 4800 oz xct = 192 oz i = A j=1

xtc = 2,688 oz xtt = 1632 oz

384 oz 96 oz Subject to
xoc = xot =
7872 oz 1920 oz 8
480 jars 120 jars ∑x
j=1
ij ≤ available hours, i = A,…, F
Z = $1,313.66
F

∑x
i=A
ij = project hours, j = 1,…, 8
57. (a) x1 = no. of jars of applesauce F
x2 = no. of bottles of apple juice ∑ (hourly rate) • x
i=A
ij ≤ Budget, j = 1,…, 8
y1 = $ amount spent on advertising applesauce
y2 = $ amount spent on advertising apple juice
(b) Solution:
maximize Z = .85x1 + .90x2 – y1 – y2
xA7 = 290 xD8 = 129.7
subject to
xA8 = 70.3 xE2 = 240
x1 ≤ 5,000 + 3y1
xB1 = 219.7 xE3 = 400
x2 ≤ 4,000 + 5y2 xC1 = 110 xE6 = 70
.60x1 + .85x2 + y1 + y2 ≤ $16,000 xC6 = 390 xF4 = 475
x1 ≥ .30(x1 + x2) xD1 = 170.3 xF5 = 350
x1 ≤ .60(x1 + x2) Z = 12,130
x1, x2, y1, y2 ≥ 0
(c) xA4 = 257.2 xE1 = 129.7
xA5 = 192.8 xE2 = 240
(b)x1 = 5,458.128 xB4 = 95 xE3 = 270
x2 = 12,735.63 xC1 = 333.3 xE8 = 33.3
y1 = 152.709

55
 xC8 = 166.7 xF5 = 110 1.1(x1 + x2 + x3) + 2.7y3 ≤ 200
xD3 = 130 xF6 = 460 1.1(x1 + x2 + x3 + x4) + 2.7y4 ≤ 200
xD4 = 112.8 xF7 = 290 1.1(x1 + x2 + x3 + x4 + x5) + 2.7y5 ≤ 200
xD5 = 47.2 1.1(x1 + x2 + x3 + x4 + x5 + x6) + 2.7y6 ≤ 200
Z = $576,250 1.1(x1 + x2 + x3 + x4 + x5 + x6 + x7) + 2.7y7 ≤ 200
1.1(x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8) + 2.7y8 ≤ 200
60. (a) x = full-time operators xi, yi ≥ 0
yi = part-time operators hired in week i, where
Solution:
i = 1,2,...8
x1 = 0 y1 = 72.22
8
Minimize Z = $4, 880 x + $450∑ yi x2 = 4 y2 = 72.44 Z = $360,196
i =1 x3 = 18.4 y3 = 64.95
x4 = 6.4 y4 = 62.34
subject to x5 = 24.8 y5 = 52.24
y6 = 38.90
360x + 270y1 = 19,500
y7 = 28.53
360x + 270y2 = 21,000
y8 = 43.35
360x + 270y3 = 25,600
360x + 270y4 = 27,200 62. Z values: A = .9276, B = 1.000, C = 1.000, D =
360x + 270y5 = 33,400 1.000 Police station A is inefficient.
360x + 270y6 = 29,800
63. Minimize Z = 1x1D + 3x1E + 5x1F + 6x1G +
360x + 270y7 = 27,000
9x1H +10x1I + 12x1J + 1x2E + 3x2F + 4x2G +
360x + 270y8 = 31,000
7x2H + 8x2I + 10x2J + 2x3F + 3x3G + 6x3H +
1.1x + 2.7yi ≤ 200, i = 1,2,...,8 7x3I + 9x3J + 1x4I + 3x4J + 1x5J + 6xA4 +
x, yi ≥ 0 8xA5 +10xA6 + 11xA7 + 5xB4 + 7xB5 + 9xB6 +
Note: Objective function coefficient 10xB7 + 4xC4 + 6xC5 + 8xC6 + 9xC7 + 2xD4 +
of $4,880 for x is computed as 4xD5 + 6xD6 + 7xD7 + 2xE5 + 4xE6 + 5xE7 +
($610/week)(8 weeks). 2xF6 + 3xF7 + 1xG6 + 2xG7

(b)Solution subject to
x1D + x1E + x1F + x1G + x1H + x1I + x1J ≤ 2
x = 53.6 full-time operators
y1 = 0.76 part-time operators x2E + x2F + x2G + x2H + x2I + x2J ≤ 2
y2 = 6.31 part-time operators x3F + x3G + x3H + x3I + x3J ≤ 2
y3 = 23.35 part-time operators x4I + x4J ≤ 1
y4 = 29.27 part-time operators x5J ≤ 1
y5 = 52.24 part-time operators x A 4 + x A 5 + x A6 + x A 7 = 1
y6 = 38.90 part-time operators x B4 + x B 5 + x B6 + x B 7 = 1
y7 = 28.53 part-time operators xC 4 + xC 5 + xC 6 + xC 7 = 1
y8 = 43.35 part-time operators x D 4 + x D5 + x D 6 + x D 7 = 1
Z = $361,788 xE 5 + x E 6 + xE 7 ≤ 1
xF 6 + xF 7 ≤ 1
61. Minimize Z = 4880x1 + 4270x2 + 3660x3 + xG 6 + xG 7 ≤ 1
3050x4 + 2440x5 + 1830x6 + 1220x7 + 610x8 + x1D + x D 4 + x D5 + xD 6 + x D 7 = 1
450 g yi x1E + x2E + xE 5 + xE 6 + x E 7 = 1
subject to x1F + x2F + x3F + x F 6 + xF 7 = 1
360x1 + 270y1 = 19,500 x1G + x2G + x3G + xG 6 + xG 7 = 1
360(x1 + x2) + 270y2 = 21,000 x A4 + x B 4 + xC 4 + x D 4 + x4I + x4J = 1
360(x1 + x2 + x3) + 270y3 = 25,600 x A5 + x B5 + xC 5 + x D5 + xE 5 + x5J = 1
360(x1 + x2 + x3 + x4) + 270y4 = 27,200 x A6 + xB 6 + xC 6 + x D6 + x E 6 + xF 6 + xG 6 = 1
360(x1 + x2 + x3 + x4 + x5) + 270y5 = 33,400 x A7 + xB 7 + xC 7 + x D 7 + x E 7 + xF 7 + xG 7 = 1
360(x1 + x2 + x3 + x4 + x5 + x6) + 270y6 = 29,800 x1H + x2H + x3H = 1
360(x1 + x2 + x3 + x4 + x5 + x6 + x7) + 270y7 = 27,000 x1I + x2I + x3I + x4I = 1
360(x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8) + 270y8 = 31,000 x1J + x2J + x3J + x4J + x5J = 1
1.1x1 + 2.7y1 ≤ 200
xij ≥ 0
1.1(x1 + x2) + 2.7y2 ≤ 200

56
 Solution: x12 ≤ 60, 000
1 – D (1 hr) and 1 – I (10 hr) x13 ≤ 50, 000
2 – E (1 hr) and 2 – H (7 hr) x14 ≤ 55, 000
3 – F (2 hr) and 3 – G (3 hr) x15 ≤ 60, 000
5 – J (1 hr)
A – 7 (11 hr) x26 + x27 + x28 ≤ 50, 000
B – 6 (9 hr) x36 + x37 + x38 ≤ 40, 000
C – 4 (4 hr) x46 + x47 + x48 ≤ 46, 000
x56 + x57 + x58 ≤ 50, 000
Z = 49 hours (ground time)
x69 + x610 + x611 ≤ 12, 000
7 crews originate at Pittsburgh; 3 in Orlando x79 + x710 + x711 ≤ 14, 000
An extra crew ferries on flights 1, 2, and 3 from x89 + x810 + x811 ≤ 19, 000
Pittsburgh. x912 ≤ 14, 000
x1012 ≤ 16, 000
64. xij = flow of product from node i to node j x1112 ≤ 12, 000
x ij ≥ 0
Maximize Z = .17(x26 + x27 + x28) + .20(x36 + x37 +
x38) + .18(x46 + x47 + x48) + .16(x56
+ x57 + x58) + .26(x69 + x610 + x611) solution:
+ .29(x79 + x710 + x711) + .27(x89
x12 = x13 = x14 = x15 = 37, 000
+ x810 + x811) + .12(x912) + .11(x1012)
x26 = x36 = x46 = x56 = 12, 000
+.14(x1112)
x27 = x37 = x47 = x57 = 6, 000
subject to x28 = x38 = x48 = x58 = 19, 000
x69 = 5, 000
x79 = 6, 000
x12 = x26 + x27 + x28
x13 = x36 + x37 + x38 x89 = 3, 000
x14 = x46 + x47 + x48 x810 = 16, 000
x15 = x56 + x57 + x58 x611 = 7, 000
x912 = 14, 000
x1012 = 16, 000
.25x26 + .25x36 + .25x46 + .25x56 = x69 + x610 + x611
x1112 = 7, 000
x26 = x36 Z = $40, 680
x36 = x46
x46 = x56

.25x27 + .25x37 + .25x47 + .25x57 = x79 + x 710 + x711 CASE SOLUTION:

SUMMER SPORTS CAMP AT STATE
x27 = x37 UNIVERSITY
x37 = x47
x47 = x57
Model Formulation:
.25x28 + .25x38 + .25x48 + .25x58 = x89 + x810 + x811 wi = new sheets purchased in week i
(i = 1,2,...8)
x28 = x38 xi = sheets cleaned at laundry at end of week i
x38 = x48 yi = sheets cleaned by Mary’s friends at end of
x48 = x58
week i
x69 + x79 + x89 = x912 minimize Z = 10(w1 + w2 + w3 + w4 + w5 + w6 +
x610 + x710 + x810 = x1012 w7 + w8) + 4(x1 + x2 + x3 + x4 + x5 +
x611 + x711 + x811 = x1112 x6) + 2(y1 + y2 + y3 + y4 + y5)
x9112 + x1012 + x1112 = 37,000 subject to
w1 = 115
x1 + y1 = 115

57
 w2 = 210 .06A1 + .13A2 + .05A3 + .10A4 ≤ 600 hrs.
x2 + y2 = 210 .06y1 + .13y2 + .05y3 + .10y4 ≤ 100 hrs.
w3 + .8x1 = 250 .05A1 + .21A2 + .02A3 + .10A4 ≤ 550 hrs.
x3 + y3 = 250 .05y1 + .21y2 + .02y3 + .10y4 ≤ 100 hrs.
w4 + .8x2 + .8y1 = 230 .03A1 + .15A2 + .04A3 + .15A4 ≤ 500 hrs.
x4 + y4 = 230 .03y1 + .15y2 + .04y3 + .15y4 ≤ 100 hrs.
w5 + .8x3 + .8y2 = 260 R1 + S1 + x1 = A1 + y1
x5 + y5 = 260 R2 + S2 + x2 = A2+ y2
w6 + .8x4 + .8y3 = 300 R3 + S3 + x3 = A3 + y3
x6 = 300 R4 + S4 + x4 = A4 + y4
w7 + .8x5 + .8y4 = 250 y1 + A1 = 1,800
w8 + .8x6 +.8y5 ≥ 190 y2 + A2 = 1,400
wi, xi, yi ≥ 0 y3 + A3 = 1,600
y4 + A4 = 1,800
Model Solution: Ri, Si, xi, Ai, yi ≥ 0
w1 = 115 x1 = 0 y1 = 115
Solution:
w2 = 210 x2 = 0 y2 = 210
w3 = 250 x3 = 52.5 y3 = 197.5 R1 = 1,691.954 s1 = s2 = s3 = 0
w4 = 138 x4 = 177.5 y4 = 52.5 R2 = 1,319.54 s2 = 866.6667
w5 = 50 x5 = 260 y5 = 0 R3 = 1,600 y1 = 0 Z = $85,472.60
w6 = 0 x6 = 300 R4 = 933.33 y2 = 315.1514
w7 = 0 A1 = 1,800 y3 = 0
w8 = 0 A2 = 1,084.849 y4 = 388.1822
Z = $11,940 A3 = 1,600 x1 = 108.0457
A4 = 1,461.818 y2 = 80.4599
x3 = x4 = 0
CASE SOLUTION:
SPRING GARDEN TOOLS
CASE SOLUTION:
Model Formulation: SUSAN WONG’S PERSONAL
Let i = 1 (trowel), 2 (hoe), 3 (rake), 4 (shovel) BUDGETING MODEL
Ri = regular production of product i in stage 1
Si = subcontracted production of product i in (b)Let xij = amount invested for i months in month
stage 1 j where i = 1,3 and 7, and j = 1, 2, ..., 12.
xi = overtime production of product i in
stage 1 12 12 12

Ai = regular production of product i in Max Z = ∑ 0.005x1 j + ∑ 0.02 x3 j + ∑ 0.07 x7 j

j =1 j =1 j =1
stage 2
yi = overtime production of product i in
stage 2 subject to
minimize Z = $6R1 + 10R2 + 8R3 + 10R4 + 7.2S1 Jan: –x11 – x31 – x71 + 2,450 + 3,800 = 2,750
+ 12S2 + 9.6S3 + 12S4 + 6.2x1 + Feb: x11 – x12 – x32 – x72 + 2,450 = 2,860
10.7x2 +8.5x3 + 10.7x4 + 3A1 + 5A2 Mar: x12 – x13 – x33 – x73 + 2,450 = 2,335
+ 4A3 + 5A4 + 3.1y1 + 5.4y2 + 4.3y3 Apr: x13 – x14 + x31 – x34 – x74 + 2,450 = 2,120
+ 5.4y4 May: x14 – x15 + x32 – x35 – x75 + 2,450 = 2,205
subject to
June: x15 – x16 + x33 – x36 – x76 + 2,450 = 1,600
.04R1 + .17R2 + .06R3 + .12R4 ≤ 500 hrs. July: x16 – x17 + x34 – x37 – x77 + 2,450 = 3,050
.04x1 + .17x2 + .06x3 + .12x4 ≤ 100 hrs. Aug: x17 – x18 + x35 – x38 + x71 – x78 + 2,450 = 2,300
.05R1 + .14R2 + .14R4 ≤ 400 hrs. Sep: x18 – x19 + x36 – x39 + x72 – x79 + 2,450 = 1,975
.05x1 + .14x2 + .14x4 ≤ 100 hrs. Oct: x19 – x110 + x37 – x310 + x73 – x710 + 2,450 = 1,670
1.2R1 + 1.6R2 + 2.1R3 + 2.4R4 Nov: x110 – x111 + x38 – x311 + x74 – x711 + 2,450 = 2,710
+ 1.2x1 + 1.6x2 + 2.1x3 + 2.4x4 ≤ 10,000 ft2 Dec: x111 – x112 + x39 – x312 + x75 – x712 + 2,450 = 2,980

58
 minimize Z = $850xnv + 720xnm + 910xnt + 750xni
Investments (i = 1,3,7)
+ 970xpv + 790xpm + 1,050xpt
Month ( j) 1-month 3-month 7-month + 880xpi + 900xov + 830xom + 780xot
1. January x11 = 3500 + 820xoi + 2,100yjv + 2,350yjm
2. February x72 = 3090 + 2,200yjt + 1,900yji + 4,100ykv
+ 4,300ykm + 3,950ykt + 3,900yki
3. March x73 = 115
+ 2,600ylv + 2,300ylm + 2,500ylt
4. April x74 = 330 + 2,800yli
5. May x75 = 245
6. June x16 = 600 x36 = 250 subject to
7. July xnv + xnm + xnt + xni ≤ 1,400
8. August x38 = 150 xpv + xpm + xpt + xpi ≤ 1,100
9. September x39 = 3815 xov + xom + xot + xoi ≤ 1,700
10. October x110 = 895 xnv + xpv + xov ≤ 1,200
11. November x111 = 1115 xnm + xpm + xom ≤ 1,100
xnt + xpt + xot ≤ 1,400
12. December x712 = 4645
xni + xpi + xoi ≤ 1,400
yjv + yjm + yjt + yji = 1,200
Z = $704.60 earned in interest payments ykv + ykm + ykt + yki = 900
ylv + ylm + ylt + yli = 700
(b)Using sensitivity analysis for the January yjv + 2ykv + 1.5ylv = xnv + xpv + xov
constraint, the lower range for the right hand yjm + 2ykm + 1.5ylm = xnm + xpm + xom
side is –410. Thus, Susan needs $710 out of her yjt + 2ykt + 1.5ylt = xnt + xpt + xot
original $3,800 to make the model feasible yji + 2yki + 1.5yli = xni + xpi + xoi
(i.e., avoid an infeasible solution). xij, yij ≥ 0

CASE SOLUTION: Solution:

WALSH’S JUICE COMPANY
xni = 1400 yji = 1200
xij = tons of unprocessed grape juice transported xpm = 1100 ykv = 75
from vineyard i to plant j where i = n (New xov = 150 ykm = 25
York), p (Pennsylvania), o (Ohio), and j = v xot = 1400 ykt = 700
(Virginia), m (Michigan), t (Tennessee), i yki = 100
(Indiana). ylm = 700

yij = tons of grape juice processed into product i at Z = $10,606,000

plant j where i = j (juice), k (concentrate), l
(jelly)

59