Class 12 Linear Programming · Very Long Answer5 Marksgraphical_optimization

Class 12 Maths · Linear Programming · Very Long Answer #68

Maximize Z=2*x + 5*y subject to 2*x + 4*y ≤ 8; 3*x + y ≤ 6; x + y ≤ 4; -x ≤ 0; -y ≤ 0. Solve graphically.

✅ Step-by-Step Solution

Final Answer: max Z=10 at (0,2).

Draw each boundary ax+by=c and retain the closed half-plane ax+by≤c; intersect all constraints, including x,y≥0.
Boundary equations: 2*x + 4*y = 8; 3*x + y = 6; x + y = 4; -x = 0; -y = 0. Use an off-line test point to choose each half-plane.
Solving pairs of boundary equations and rejecting points violating any inequality gives vertices: (0,0), (0,2), (8/5,6/5), (2,0).
Evaluate the objective at every vertex: (0,0) → 0; (0,2) → 10; (8/5,6/5) → 46/5; (2,0) → 4.
The region is bounded. max Z=10 at (0,2).

[1 mark] Draw each boundary ax+by=c and retain the closed half-plane ax+by≤c; intersect all constraints, including x,y≥0.
[1 mark] Boundary equations: 2*x + 4*y = 8; 3*x + y = 6; x + y = 4; -x = 0; -y = 0. Use an off-line test point to choose each half-plane.
[1 mark] Solving pairs of boundary equations and rejecting points violating any inequality gives vertices: (0,0), (0,2), (8/5,6/5), (2,0).
[1 mark] Evaluate the objective at every vertex: (0,0) → 0; (0,2) → 10; (8/5,6/5) → 46/5; (2,0) → 4.
[1 mark] The region is bounded. max Z=10 at (0,2).

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.