Linear Programming Problems

1. Maximize z = 6x
1
+ 4x
2
subject to
x
1
700
x
2
900
3x
1
+ x
2
2400
x
1
+ 2x
2
1600
x
1
, x
2
0
Solution: (640, 480) , z
max
= 5760
2. Maximize z = x
1
+ x
2
subject to
x
1
+ x
2
1
5x
1
+ 10x
2
50
x
2
4
x
1
, x
2
0
Solution: (10, 0) , z
max
= 10
3. Maximize z = 3x
1
+ 2x
2
subject to
x
1
+ x
2
1
5x
1
+ x
2
0
x
1
+ 5x
2
0
x
1
+ x
2
6
x
1
, x
2
0
Solution: (5, 1) , z
max
= 17
4. Maximize z = 4x
1
+ 3x
2
subject to
x
1
+ x
2
10
2x
1
+ 2x
2
40
x
1
, x
2
0
Solution: Infeasible.
5. Maximize z = 3x
1
+ 4x
2
subject to
x
1
x
2
0
2x
1
+ 2x
2
2
x
1
, x
2
0
Solution: (2, 2) , z
max
= 2
6. Maximize z = 2x
1
+ x
2
subject to
11x
1
+ 3x
2
33
8x
1
+ 5x
2
40
7x
1
+ 10x
2
70
x
1
, x
2
0
Solution: (5, 0) , z
max
= 10
7. Minimize z = 5x
1
+ 8x
2
subject to
x
1
400
x
2
200
x
1
+ x
2
= 500
x
1
, x
2
0
Solution: (300, 200) , z
min
= 3100
8. Minimize z = 22x
1
+ 6x
2
subject to
11x
1
+ 3x
2
33
8x
1
+ 5x
2
40
7x
1
+ 10x
2
70
x
1
, x
2
0
Solution: (3, 0) or

45
31
,
176
31

, z
min
= 66
9. Minimize z = 2x
1
+ 6x
2
subject to
3x
1
+ 2x
2
6
x
1
x
2
1
2x
1
x
2
2
x
1
, x
2
0
Solution: (2, 0) z
min
= 4
10. Maximize z = 8x
1
+ 5x
2
subject to
10x
1
+ 9x
2
90
4x
1
+ 3x
2
12
x
1
, x
2
0
Solution: (9, 0) z
max
= 72
11. Maximize z = 6x
1
+ 2x
2
subject to
5x
1
+ 6x
2
30
7x
1
+ 8x
2
56
x
1
, x
2
0
Solution: (8, 0) z
max
= 48
12. Maximize z = x
1
2x
2
subject to
x
1
2x
2
2
x
1
+ x
2
4
x
1
, x
2
0
Solution:

10
3
,
2
3

, z
max
= 2
13. Maximize z = 3x
1
+ 2x
2
subject to
x
1
+ x
2
10
3x
1
+ x
2
3
x
1
x
2
6
x
1
, x
2
0
Solution: (8, 2) , z
max
= 28
14. Minimize z = 3x
1
+ 4x
2
subject to
3x
1
+ x
2
9
x
1
+ x
2
7
x
1
+ 2x
2
8
x
1
, x
2
0
Solution: (1, 6) z
min
= 27
15. Minimize z = 30x
1
+ 40x
2
subject to
2x
1
x
2
12
x
1
+ x
2
9
x
1
+ 3x
2
15
x
1
, x
2
0
Solution:

51
7
,
18
7

, z
min
=
2250
7
16. Maximize z = 2x
1
+ 8x
2
subject to
x
1
+ x
2
9
3x
1
+ x
2
12
x
1
, x
2
0
Solution: unbounded case
17. Minimize z = 8x
1
+ 9x
2
+ 5x
3
subject to
2x
1
+ 3x
2
+ x
3
2
5x
1
+ 2x
2
3x
3
4
7x
1
+ 6x
2
+ 4x
3
5
x
1
, x
2
, x
3
0
Solution:

8
11
,
2
11
, 0

, z
min
=
82
11
18. Minimize z = 20x
1
+ 20x
2
+ 40x
3
subject to
2x
1
+ 5x
2
+ 6x
3
6
6x
1
+ 2x
2
+ 12x
3
9
5x
1
+ 4x
2
+ 8x
3
8
x
1
, x
2
, x
3
0
Solution:

3
8
,
21
40
,
29
80

, z
min
= 37
19. Minimize z = 65x
1
+ 120x
2
+ 70x
3
subject to
x
1
+ x
2
+ 2x
3
5
x
1
+ 2x
2
+ 2x
3
6
2x
1
+ 4x
2
+ x
3
8
x
1
, x
2
, x
3
0
Solution:

4
3
, 1,
4
3

, z
min
= 300
20. Maximize z = 3x
1
+ 4x
2
subject to
2x
1
+ 3x
2
= 4
2x
1
+ x
2
2
x
1
, x
2
0
Solution:

1
2
, 1

z
max
= 5
1
2
21. Maximize z = 2x
1
+ 4x
2
subject to
x
1
+ 2x
2
3
x
1
+ x
2
= 2
x
1
, x
2
0
Solution: (1, 1) z
max
= 6
22. Maximize z = 2x
1
x
2
subject to
x
1
+ 3x
2
6
x
1
x
2
= 2
x
1
, x
2
0
Solution: (3, 1) z
max
= 5
23. Maximize z = x
1
+ 2x
2
subject to
2x
1
+ x
2
4
x
1
+ x
2
= 3
x
1
, x
2
0
Solution: (0, 3) z
max
= 6
24. Minimize z = 12x
1
+ 16x
2
subject to
x
1
+ x
2
= 50
x
1
30
x
2
20
x
1
, x
2
0
Solution: (30, 20) z
min
= 680
25. Minimize z = 6x
1
+ 10x
2
subject to
x
1
12
x
2
= 18
3x
1
+ 2x
2
54
x
1
, x
2
0
Solution: (6, 18) z
min
= 216
26. Maximize z = x
1
+ x
2
subject to
x
1
+ x
2
2
2x
1
+ x
2
3
2x
1
+ x
2
= 2
x
1
, x
2
0
Solution: (0, 2) z
max
= 2
27. Maximize z = 4x
1
+ 12x
2
subject to
3x
1
+ x
2
180
x
1
+ 2x
2
= 100
2x
1
+ 2x
2
40
x
1
, x
2
0
Solution: (20, 40) z
max
= 560
28. Minimize z = x
1
+ x
2
subject to
x
1
+ x
2
2
2x
1
+ x
2
3
2x
1
+ x
2
= 2
x
1
, x
2
0
Solution: (1, 0) z
min
= 1
29. Maximize z = 5x
1
+ 15x
2
subject to
4x
1
+ x
2
200
x
1
+ 3x
2
120
x
1
+ 3x
2
= 150
x
1
, x
2
0
Solution:

450
13
,
800
13

z
max
=
14250
13
30. Maximize z = 6x
1
+ 4x
2
subject to
3x
1
+ 2x
2
60
2x
1
+ 3x
2
24
x
1
+ x
2
= 25
x
1
, x
2
0
Solution: (10, 15) z
max
= 120
31. Minimize z = x
1
+ 4x
2
+ x
3
subject to
x
1
+ x
2
+ x
3
= 2
x
1
+ 2x
2
1
x
1
, x
2
, x
3
0
Solution:

0,
1
2
,
3
2

, z
min
= 3.5
32. Minimize z = 4x
1
+ 3x
2
+ x
3
subject to
x
1
+ x
2
+ x
3
= 9
4x
1
5x
2
5x
3
0
x
1
+ x
3
0
x
1
, x
2
, x
3
0
Solution: (5, 0, 4) , z
min
= 24
33. Maximize z = 7x
1
+ 2x
2
+ 5x
3
subject to
2x
1
+ x
2
+ x
3
50
x
1
+ x
2
+ 2x
3
40
x
1
+ 3x
2
+ x
3
= 35
x
1
, x
2
, x
3
0
Solution:

135
7
,
15
7
,
65
7

, z
max
=
1300
7
34. Maximize z = 2x
1
+ 3x
2
subject to
2x
1
+ x
2
= 2
x
1
+ x
2
= 1
x
1
, x
2
0
Solution:

1
3
,
4
3

, z
max
=
14
3
35. Minimize z = 3x
1
+ 2x
2
+ 3x
3
+ x
4
subject to
8x
1
+ 2x
2
+ 2x
3
4x
4
= 4
3x
1
3x
2
+ x
3
x
4
= 18
x
1
, x
2
, x
3
, x
4
0
Solution: (17, 0, 0, 33) , z
min
= 54
36. Minimize z = 4x
1
+ 2x
2
+ x
3
5x
4
subject to
x
1
x
2
+ 2x
3
5x
4
= 13
3x
1
+ 9x
2
6x
3
3x
4
= 3
x
1
, x
2
, x
3
, x
4
0
Solution: (0, 7, 10, 0) , z
min
= 24
37. Minimize z = x
1
3x
2
14x
3
4x
4
subject to
x
1
2x
2
+ 2x
3
2x
4
= 4
4x
1
6x
2
+ 9x
3
3x
4
= 17
x
1
, x
2
, x
3
, x
4
0
Solution: (2, 0, 1, 0) , z
min
= 16
38. Minimize z = 2x
1
+ 6x
2
subject to
3x
1
+ 2x
2
6
x
1
x
2
1
2x
1
x
2
2
x
1
, x
2
0
Solution: (2, 0) , z
min
= 4
39. Minimize z = 2x
1
+ 3x
2
+ 4x
3
subject to
2x
1
+ x
2
+ 3x
3
12
x
1
+ 2x
2
+ x
3
18
x
1
, x
2
, x
3
0
Solution: (2, 8, 0) , z
min
= 28