Chapter Five: Integer Programming

PROBLEM SUMMARY 28. Integer model, formulation and computer

solution
1. Integer model, graphical solution
29. 0–1 integer model, computer solution
2. Integer model
30. Integer model, formulation and computer
3. Integer model solution

4. Integer model 31. Mixed-integer model, formulation and

computer solution (7–30)
5. Integer model
32. Set covering problem, 0–1 integer model and
6. Integer model computer solution

7. Integer model 33. 0–1 integer model and computer solution

34. Set covering problem, 0–1 integer model and
8. Mixed integer model
computer solution
9. 0–1 integer model 35. Facility location problem, 0–1 integer model
10. Integer model and computer solution
11. Integer model
PROBLEM SOLUTIONS
12. 0–1 integer model
1.
13. Integer model, formulation and computer x2 x2
solution
4 4
14. Integer model, formulation and computer
3 Relaxed solution: 3
solution x1 = 3.33
Relaxed
2 2 solution:
15. Set covering problem, integer model, x2 = 0 x1 = 3
formulation and computer solution 1 1 x2 = 0
x1 x1
16. Integer model, formulation and computer 1 2 3 4 5 1 2 3 4 5
solution
17. Integer model, formulation and computer 2. x1 = 6, x2 = 0, Z = 18
solution
18. Integer model, knapsack problem, formulation 3. (a)maximize Z = 50x1 + 40x2 (profit)
and computer solution
subject to
19. Integer model, formulation and computer
solution 3x1 + 5x2 ≤ 150 yd2
10x1 = 4x2 ≤ 200 hr.
20. Plant location problem, integer model, x1,x2 ≥ 0 and integer
formulation and computer solution
21. Continuation of Problem 20, formulation (b) Relaxed solution:

22. Continuation of Problem 20, formulation x1 = 10.5, x2 = 23.7, Z = 1,473

23. Integer model, formulation and computer Rounded down solution:

solution
x1 = 10, x2 = 23, Z = 1,420
24. 0–1 integer-model, computer solution
25. Integer model, computer solution Integer solution:

26. Integer model, formulation and computer x1 = 10, x2 = 24, Z = 1,460

solution
The rounded down solution is not optimal.
27. Integer model with 0-1 restriction

69
4. (a)maximize Z = $400x1 + 100x2 Rounded down solution:
subject to x1 = 2, x2 = 5, Z = 300
8x1 = 10x2, ≤ 80
Integer solution:
2x1 = 6x2 ≤ 36
x1 ≤ 6 x1 = 4, x2 = 4, Z = 360
x1,x2 ≥ 0 and integer
The rounded down solution is not optimal.
(b) Relaxed solution:
x1 = 6, x2 = 3.2, Z = 2,720 8. (a)maximize Z = $8000x1 + 6000x2
subject to
Rounded down solution:
70x1 + 30x2, ≤ 500
x1 = 6, x2 = 3, Z = 2,700
x1 + 2x2 ≤ 14
x1 ≥ 0 and integer
Integer solution:
x2 ≥ 0
x1 = 6, x2 = 3, Z = 2,700
(b) x1 = 5, x2 = 4.5, Z = 67,000
Integer solution same as rounded down
solution.
9. x1 = 1, x2 = 0, x3 = 1, Z = 1,800

5. (a)maximize Z = 50x1 + 10x2

10. x1 = 0, x2 = 4, x3 = 1.33, Z = 29.32
subject to
x1 + x2, ≤ 15 11. minimize Z = 81x1 + 50x2
4x1 + x2 ≤ 25
subject to
x1,x2 ≥ 0 and integer
76x1 = 53x2, ≥ 600
(b) x1 = 6, x2 = 1, Z = 310 x1 + x2 ≤ 10
1.3x1 = 4.1x2, ≤ 24
x1,x2≥ 0 and integer
6. (a)maximize Z = 600x1 + 540x2 + 375x3
Solution:
subject to
x1 + x2 + x3, ≤ 12 x1 = 6
x1 ≤ 5 x2 = 3
80x1 + 70x2 + 50x3 ≤ 750 Z = $636
x1,x2,x3 ≥ 0 and integer
12. x1 = 1, x4 = 1, Z = 60
(b) x1 = 0, x2 = 10, x3 = 1, Z = 5,775

7. (a)maximize Z = 50x1 + 40x2

subject to
2x1 + 5x2, ≤ 35
3x1 + 2x2 ≤ 20
x1,x2 ≥ 0 and integer y1 = 0, Z = $600,000

(b) Relaxed solution:

x1 = 2.73, x2 = 5.91, Z = 372.9

70
 17. (a) x1 = tv ads
x2 = newspaper ads
x3 = radio ads
minimize Z = $25,000x1 + 7,000x2 + 9,000x3
subject to:
53,000x1 + 30,000x2 + 41,000x3  200,000
32,000x1 + 20,000x2 + 18,000x3
  1.5
(21,000x1+ 10,000x2 + 23,000x3)
34,000x1 + 12,000x2 + 24,000x3
  .60
(53,000x1 + 30,000x2 + 41,000x3)
x1,x2,x3,x4  0 and integer

Integer solution:
x1 = 4
x2 = 0
x3 = 0
Z = $99,999.99
(b) Non-integer solution:
x1 = 2.9275
x2 = .9713
x3 = .383
Z = $83,433.65
16. x1 = day contacts by phone
x2 = day contacts in person 18.
x3 = night contacts by phone
x4 = night contacts in person
Maximize Z = $16x1 + 33x2 + 17x3 + 37x4
subject to: 19.
x2 + x4  575
6x1 + 13x2  1,320
7x3 + 19x4  2,580
x1,x2,x3,x4  0 and integer

Integer solution:
x1 = 220
x3 = 368
Z = $9,776

The non-integer solution is: 20.

x1 = 220
x3 = 368.57
Z = $9,785.71
The rounded down solution is only slightly less
(i.e., $9.71)

+ 61x4C

71
 24. a) minimize Z = 5x1 + 10x2 + 8x3 + l2x4 + 7x5
+ 10x6 + 8x7
subject to
9x1 + 6x2 + 6x3 + 3x4 + 6x5 + 3x6 + 9x7 ≥ 2.00
3(x1 + x2 + x3 + x4 + x5 + x6 + x7)
3(x1 + x2 + x3 + x4 + x5 + x6 + x7) ≥ 12
x2 + x3 + x4 + x6 ≤ 2
x1 + x2 + x6+ x7 ≥ 3
xi = 0 or 1
b) x1 = 1 (Management I)
x2 = 1 (Principles of Accounting)
x5 = 1 (Marketing Management)
Solution: y2, y4, y5 = 1, x2A = 6,000 x7 = 1 (English Literature)
x2B = 4,000, x2C = 2,000, x4B = 10,000, Z = 30 hours per week
x5C = 6,000, x5D = 10,000, Z = $3,902,000 Minimum grade point average = 2.50
25. a) maximize Z = 1,650x1 + 850x2 + 790x3
21. Add the constraint y2 + y4  1.
subject to
Solution: y2, y3, y5 = 1, x2B = 14,000
x2C = 2,000, x3A = 6,000, x5C = 6,000, 6.3x1 + 3.9x2 + 3.1x3 ≤ 125
x5D = 10,000, Z = $4,786,000 17x1 + 10x2 + 7x3 ≤ 320
x1,x2,x3, ≥ 0 and integer
22. Add the constraint y5  y1. b) x1 = 10
Solution: y1, y2, y5 = 1, x1B = 12,000 x3 = 20
x2A = 6,000, x2B = 2,000, x2C = 2,000, Z = 32,300
x5C = 6,000, x5D = 10,000, Z = $4,822,000 The relaxed, noninteger solution is,
x1 = 13.61
23. Maximize Z = 12,100x1 + 8,700x2 + 10,500x3 x3 = 12.67
Z = 32,460.46
subject to: The rounded down solution is x1 = 13,
360x1 + 375x2 + 410x3  30,000 x3 = 12, and Z = 30,930, which is not optimal.
x1 + x2 + x3  67 26. maximize Z = 575x1 + 120x2
14x1 + 10x2 + 18x3  2,200
x1/x3  2 subject to
x2/x1  1.5 40x1 + 15x2 ≤ 600
x1,x2,x3  0 and interger 30x1 + 18x2 ≤ 480
4x1 – x2 ≤ 0
Integer solution: x1, x2 ≥ 0 and integer
x1 = 22 Optimal solution:
x2 = 34
x3 = 11 x1 = 4
Z = $677,500 x2 = 20
Z = 4,700

72
27. Maximize Z = $575x1 + 120x2 + 45x3 29. a. maximize Z = 18x1A + 20x1B + 21x1C + 17x1D
+ 19x2A + 15x2B + 22x2C + 18x2D + 20x3A +
subject to:
20x3B + 17x3C + 19x3D + 24x4A + 21x4B +
40x1 + 15x2 + 4x3  600 16x4C + 23x4D + 22x5A + 19x5B + 21x5C +
30x1 + 18x2 + 5x3  480 21x5D
4x1 – x2  0
x3 = 20y1
subject to
x1,x2,x3  0 and interger
(.3x1A + .9x1B + .6x1C + .4x1D + .8x2A + .5x2B
y1 = 0 or 1
+ 1.1x2C + .7x2D + 1.1x3A + 1.3x3B + .6x3C +
Or the last restriction that y1 = 0 or 0 can be .8x3D + 1.2x4A + .8x4B + .6x4C + .9x4D +
included in the model as a constraint, y1  1. 1.0x5A + .9x5B + 1.0x5C + 1.0x5D)/(18x1A +
20x1B + 21x1C + 17x1D + 19x2A + 152B +
Solution: 22x2C + 18x2D+ 20x3A + 20x3B + 17x3C +
x1 = 3 19x3D + 24x4A + 21x4B + 16x4C + 23x4D +
x2 = 16 22x5A + 1 9x5B + 21x5C + 21x5D) ≤ .04
x3 = 20
y1 = 1 x1A + x1B + x1C + x1D ≤ 1
Z = $4,745 x2A + x2B + x2C + x2D ≤ 1
x3A + x3B + x3C + x3D ≤ 1
They should produce the batch of 20 stools
x4A + x4B + x4C + x4D ≤ 1
since the profit is slightly greater ($4,745 vs.
x5A + x5B + x5C + x5D ≤ 1
$4,700).
x1A + x2A + x3A + x4A + x5A = 1
x1B + x2B + x3B + x4B + x5B= 1
28. x1 = bass boat x1C + x2C + x3C + x4C + x5C = 1
x2 = ski boat x1D + x2D + x3D + x4D + x5D = 1
x3 = speed boat xij= 0 or 1
Maximize Z = 20,500x1 + 12,000x2 + 22,300x3 b) x1C= 1
x3D = 1
subject to: x4B = 1
1.3x1 + 1.0x2 + 1.5x3  210 x5A = 1
x1 Z = 83 parts
 2
(x2 + x3)
30. Minimize Z = 120x1 + 75x2
x1 + 2x3  160
subject to:
x1,x2,x3  0 and integer
220x1 + 140x2  6,300
Solution:
x1 + x2  32
x1 = 110 .4x1 + .9x2  15
x2 = 31 x1,x2  0 and interger
x3 = 24
Non-integer solution:
Z = $3,162,200
x1 = 25.1409
x2 = 5.493
Z = $3,428.87
Integer solution:
x1 = 28
x2 = 1
Z = $3,435

73