Chapter 12 Linear programming problem
Practice Questions :
Solve the following linear programming problem from Q.No.1 to Q.No.3 graphically :
1. Maximize 𝑍 = 4𝑥 + 𝑦 , Subject to the constraints : 𝑥 + 𝑦 ≤ 50, 3𝑥 + 𝑦 ≤ 90, 𝑥 ≥ 0, 𝑦 ≥ 0.
2. Minimize 𝑍 = 200𝑥 + 500𝑦 , Subject to the constraints : 𝑥 + 2𝑦 ≥ 10, 3𝑥 + 4𝑦 ≤ 24, 𝑥. 𝑦 ≥ 0 .
3. Minimize and Maximize 𝑍 = 3𝑥 + 9𝑦, Subject to the constraints : 𝑥 + 3𝑦 ≤ 60, 𝑥 + 𝑦 ≥ 10, 𝑥 ≤ 𝑦, 𝑥, 𝑦 ≥
0.
4. Determine graphically the minimum value of the objective function 𝑍 = −50𝑥 + 20𝑦
subject to the constraints : 2𝑥 − 𝑦 ≥ −5, 3𝑥 + 𝑦 ≥ 3, 2𝑥 − 3𝑦 ≤ 12, 𝑥, 𝑦 ≥ 0.
Solve the following linear programming problem graphically :
5. Minimize 𝑍 = 3𝑥 + 2𝑦, Subject to the constraints : 𝑥 + 𝑦 ≥ 8, 3𝑥 + 5𝑦 ≤ 15, 𝑥, 𝑦 ≥ 0
6. Maximize 𝑍 = 3𝑥 + 4𝑦, Subject to the constraints : 𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0
7. Minimize 𝑍 = −3𝑥 + 4𝑦, subject to the constraints : 𝑥 + 2𝑦 ≤ 8, 3𝑥 + 2𝑦 ≤ 12, 𝑥. 𝑦 ≥ 0
8. Maximize 𝑍 = 5𝑥 + 3𝑦, subject to the constraints :
3𝑥 + 5𝑦 ≤ 15, 5𝑥 + 2𝑦 ≤ 10, 𝑥 ≥ 0, 𝑦 ≥ 0
9. Maximize 𝑍 = 3𝑥 + 5𝑦, subject to 𝑥 + 3𝑦 ≥ 3, 𝑥 + 𝑦 ≥ 2, 𝑥, 𝑦 ≥ 0 Figure 1
10. Maximize 𝑍 = 3𝑥 + 2𝑦, subject to +2𝑦 ≤ 10, 3𝑥 + 𝑦 ≤ 15, 𝑥, 𝑦 ≥ 0.
11. Minimize 𝑍 = 𝑥 + 2𝑦, subject to 2𝑥 + 𝑦 ≥ 3, 𝑥 + 2𝑦 ≥ 6, 𝑥, 𝑦 ≥ 0.
12. In Fig.1, the feasible region (shaded) for a LPP is shown. Determine
the maximum and minimum value of 𝑍 = 𝑥 + 2𝑦
Show that the minimum of 𝒁 occurs at more than two points.
13. Minimize and Maximize 𝑍 = 5𝑥 + 10𝑦,
subject to 𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥ 60, 𝑥 − 2𝑦 ≥ 0, 𝑥, 𝑦 ≥ 0.
14. Minimize and Maximize 𝑍 = 𝑥 + 2𝑦,
subject to 𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤ 0, 2𝑥 + 𝑦 ≤ 200 ; 𝑥, 𝑦 ≥ 0
15. Maximize 𝑍 = −𝑥 + 2𝑦, subject to the constraints ; 𝑥 ≥ 3, 𝑥 + 𝑦 ≥ 5, 𝑥 + 2𝑦 ≥ 6, 𝑦 ≥ 0.
16. Maximize 𝑍 = 𝑥 + 𝑦, subject to 𝑥 − 𝑦 ≤ −1, −𝑥 + 𝑦 ≤ 0, 𝑥, 𝑦 ≥ 0.
Solve the following linear programming problem from Q.No.16 to Q.No.22 graphically :
17. Maximize 𝑍 = 𝑥 + 𝑦
subject to 𝑥 + 4𝑦 ≤ 8, 2𝑥 + 3𝑦 ≤ 12, 3𝑥 + 𝑦 ≤ 9, 𝑥 ≥ 0, 𝑦 ≥ 0
18. Maximize 𝑍 = 2𝑥 + 3𝑦, subject to 𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0
19. Maximize 𝑍 = 510𝑥 + 675𝑦, Figure 2
subject to the constraints 𝑥 + 𝑦 ≤ 300, 2𝑥 + 3𝑦 ≤ 720, 𝑥, 𝑦 ≥ 0
20. Maximize 𝑍 = 3𝑥 + 4𝑦,
subject to the constraints 𝑥 + 𝑦 ≤ 1, 𝑥 ≥ 0 , 𝑦 ≥ 0
21. Maximize the function 𝑍 = 11𝑥 + 7𝑦,
subject to the constraints : 𝑥 ≤ 3, 𝑦 ≤ 2, 𝑥 ≥ 0, 𝑦 ≥ 0.
22. Minimize 𝑍 = 13𝑥 − 15𝑦, subject to the constraints;
𝑥 + 𝑦 ≤ 7, 2𝑥 − 3𝑦 + 6 ≥ 0, 𝑥 ≥ 0, 𝑦 ≥ 0
23. Maximize 𝑍 = 3𝑥 − 4𝑦,
subject to 𝑥 − 2𝑦 ≤ 0, −3𝑥 + 𝑦 ≤ 4, 𝑥 − 𝑦 ≤ 6, 𝑥, 𝑦 ≥ 0 Figure 3
24. Determine the maximum value of 𝑍 = 11𝑥 + 7𝑦
subject to the constraints 2𝑥 + 𝑦 ≤ 6, 𝑥 ≤ 2, 𝑥, 𝑦 ≥ 0.
25. Determine the maximum value of Z = 3x + 4y if the feasible region
(shaded) for a LPP is shown in Fig.2.
26. Feasible region (shaded) for a LPP is shown in Fig.3. Maximize 𝑍 = 5𝑥 + 7𝑦.
