Mathbee CBSE Mathbee · CBSE Class 12 Maths
Class 12 Linear Programming · Long Answer3 Marksgraphical_optimization

Class 12 Maths · Linear Programming · Long Answer #60

Maximize Z=3*x + 4*y subject to x + 2*y ≤ 76; 2*x + y ≤ 104; -x ≤ 0; -y ≤ 0. Solve graphically.
Coordinate-derived feasible-region graph for cbse12-math-lp-p1-practice_short-011
Coordinate-derived feasible-region graph for cbse12-math-lp-p1-practice_short-011

✅ Step-by-Step Solution

Final Answer: max Z=196 at (44,16).
  1. Draw each boundary ax+by=c and retain the closed half-plane ax+by≤c; intersect all constraints, including x,y≥0.
  2. Solving pairs of boundary equations and rejecting points violating any inequality gives vertices: (0,0), (0,38), (44,16), (52,0).
  3. Evaluate the objective at every vertex: (0,0) → 0; (0,38) → 152; (44,16) → 196; (52,0) → 156.
  4. The region is bounded. max Z=196 at (44,16).

📋 CBSE Stepwise Marking Scheme

  • [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,0), (0,38), (44,16), (52,0).
  • [1 mark] Evaluate the objective at every vertex: (0,0) → 0; (0,38) → 152; (44,16) → 196; (52,0) → 156.
  • [0.5 marks] The region is bounded. max Z=196 at (44,16).

Master Chapter 12: Linear Programming

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
📘 Chapter Notes & All Exercises 🚀 Open in Interactive Workspace →
← Previous Question
Z=ax+by has the same optimal value at distinct feasible points…
Next Question →
A bounded feasible polygon has successive vertices…

More Practice Questions in Linear Programming

Related Questions in Linear Programming