Scribd
Upload
30 views2 pages

Document

This document provides 14 examples of linear programming problems (LPPs) to be solved graphically. Each LPP involves maximizing or minimizing an objective function subject to various constraints involving variables x and y. The constraints define the feasible region that must be considered when finding the optimal solution.

Uploaded by

Pratham Zala
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
30 views2 pages

Document

This document provides 14 examples of linear programming problems (LPPs) to be solved graphically. Each LPP involves maximizing or minimizing an objective function subject to various constraints involving variables x and y. The constraints define the feasible region that must be considered when finding the optimal solution.

Uploaded by

Pratham Zala
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/ 2

Solve the LPP Graphically

1) Maximum 𝑍 = 15𝑥 + 2𝑦

Subject To Constraints:

𝑥 − 2𝑦 ≤ 2, 3𝑥 + 2𝑦 ≤ 12, −3𝑥 + 2𝑦 ≤ 3, 𝑥 ≥ 0, 𝑦 ≥ 0

2) Maximum 𝑍 = 5𝑥 + 3𝑦

Subject To Constraints:

2𝑥 + 𝑦 ≤ 12, 3𝑥 + 2𝑦 ≤ 20, 𝑥 ≥ 0, 𝑦 ≥ 0

3) Maximum 𝑍 = 𝑥 + 2𝑦

Subject To Constraints:

𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤ 0, 2𝑥 + 𝑦 ≤ 200, 𝑥 ≥ 0, 𝑦 ≥ 0

4) Maximum 𝑍 = 𝑥 + 𝑦

Subject To Constraints:

3𝑥 + 2𝑦 ≤ 45, 2𝑥 + 3𝑦 ≤ 42, 𝑥 ≥ 0, 𝑦 ≥ 0
5) Minimum 𝑍 = 3𝑥 + 𝑦 + 39500

Subject To Constraints:

𝑥 + 𝑦 ≤ 7000, 𝑥 ≤ 4500, 𝑦 ≤ 3000, 𝑥 + 𝑦 ≥ 3500, 𝑥 ≥ 0, 𝑦 ≥ 0

6) Minimum 𝑍 = 3𝑥 + 4𝑦 + 370

Subject To Constraints:

𝑥 + 𝑦 ≤ 60, 𝑥 ≤ 40, 𝑦 ≤ 40, 𝑥 + 𝑦 ≥ 10, 𝑥 ≥ 0, 𝑦 ≥ 0

7) Minimum 𝑍 = 0.08𝑥 + 0.10𝑦

Subject To Constraints:

𝑥 + 𝑦 ≤ 12000, 𝑥 ≥ 2000, 𝑦 ≥ 4000, 𝑥 ≥ 0, 𝑦 ≥ 0

8) Maximum 𝑍 = 𝑥 + 𝑦

Subject To Constraints:

6𝑥 + 9𝑦 ≤ 72, 𝑥 ≥ 3, 𝑦 ≥ 4, 𝑥 ≥ 0, 𝑦 ≥ 0

9) Minimum 𝑍 = 5𝑥 + 10𝑦

Subject To Constraints:

𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥ 60, 𝑥 − 2𝑦 ≥ 0, 𝑥 ≥ 0, 𝑦 ≥ 0
10) Maximum 𝑍 = 20𝑥 + 40𝑦

Subject To Constraints:

1.5𝑥 + 3𝑦 ≤ 42, 3𝑥 + 𝑦 ≤ 24, 𝑥 ≥ 0, 𝑦 ≥ 0


11) Maximum 𝑍 = 600𝑥 + 400𝑦

Subject To Constraints:

𝑥 + 2𝑦 ≤ 12, 2𝑥 + 𝑦 ≤ 12, 𝑥 + 1.25𝑦 ≥ 5, 𝑥 ≥ 0, 𝑦 ≥ 0

12) Maximum 𝑍 = 𝑥 + 𝑦

Subject To Constraints:
𝑥 𝑦
(25) + (40) ≤ 1, 2𝑥 + 5𝑦 ≤ 100, 𝑥 ≥ 0, 𝑦 ≥ 0

13) The dotted portion represents feasible solution of LPP.


Answer each of the following

(i) Write the constraints for the above


problem using the equations of lines and
feasible solution under consideration.

(ii) Also maximise the objective


function 𝑍 = 8𝑥 + 9𝑦.

14) The feasible region of the system of linear constraints is shown as

Answer each of the following

(i) Find the constraints for the LPP


taking X-along x-axis and Y-along y-axis.

(ii) If Z=400x + 300y be objective


function, find value of maximum Z and
the point of maximum.

You might also like