Solve the following linear programming problem graphically:
Maximize
subject to the constraints
Maximize
subject to the constraints
Answer: Max Z = 400 at (0, 200)
Solution
Convert the inequalities to boundary lines: , and .
The feasible corner points are:
— meets
— meets
— meets
— meets
Evaluate :
:
:
:
: ← maximum

Feasible region bounded by x + 2y = 100, 2x - y = 0 and 2x + y = 200, with corner points A(0, 50), B(20, 40), C(50, 100) and D(0, 200).
The feasible corner points are:
— meets
— meets
— meets
— meets
Evaluate :
:
:
:
: ← maximum

CBSE Class 12 Board · 2023 · Subjective