Class 12 Linear Programming · Very Long Answer5 Marksgraphical_optimization

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

Maximize Z=70*x + 40*y subject to 3*x + 2*y ≤ 9; 3*x + y ≤ 9; -x ≤ 0; -y ≤ 0. Solve graphically.

✅ Step-by-Step Solution

Final Answer: max Z=210 at (3,0).

Draw each boundary ax+by=c and retain the closed half-plane ax+by≤c; intersect all constraints, including x,y≥0.
Boundary equations: 3*x + 2*y = 9; 3*x + y = 9; -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,9/2), (3,0).
Evaluate the objective at every vertex: (0,0) → 0; (0,9/2) → 180; (3,0) → 210.
The region is bounded. max Z=210 at (3,0).

[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: 3*x + 2*y = 9; 3*x + y = 9; -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,9/2), (3,0).
[1 mark] Evaluate the objective at every vertex: (0,0) → 0; (0,9/2) → 180; (3,0) → 210.
[1 mark] The region is bounded. max Z=210 at (3,0).

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