Class 12 Linear Programming · Long Answer3 Marksgraphical_optimization

Class 12 Maths · Linear Programming · Long Answer #57

Maximize Z=6*x + 16*y subject to -x - y ≤ -2; -x ≤ 0; -y ≤ 0. Solve graphically.

✅ Step-by-Step Solution

Final Answer: max: no finite optimum (objective unbounded).

Draw each boundary ax+by=c and retain the closed half-plane ax+by≤c; intersect all constraints, including x,y≥0.
Solving pairs of boundary equations and rejecting points violating any inequality gives vertices: (0,2), (2,0).
Evaluate the objective at every vertex: (0,2) → 32; (2,0) → 12.
The region is unbounded. Its recession directions satisfy every homogeneous constraint; representatives: (1,0), (0,1), (0,1), (1,0). Their objective changes are 6, 16, 16, 6. This checks whether a finite optimum exists. max: no finite optimum (objective unbounded).

[0.5 marks] Draw each boundary ax+by=c and retain the closed half-plane ax+by≤c; intersect all constraints, including x,y≥0.
[1 mark] Solving pairs of boundary equations and rejecting points violating any inequality gives vertices: (0,2), (2,0).
[1 mark] Evaluate the objective at every vertex: (0,2) → 32; (2,0) → 12.
[0.5 marks] The region is unbounded. Its recession directions satisfy every homogeneous constraint; representatives: (1,0), (0,1), (0,1), (1,0). Their objective changes are 6, 16, 16, 6. This checks whether a finite optimum exists. max: no finite optimum (objective unbounded).

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