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

Class 12 Maths · Linear Programming · Long Answer #35

Maximize Z=5*x + 8*y subject to x + y ≤ 5; -x - y ≤ -5; x ≤ 4; -y ≤ -2; -x ≤ 0; -y ≤ 0. Solve graphically.
Coordinate-derived feasible-region graph for cbse12-math-lp-p1-short-009
Coordinate-derived feasible-region graph for cbse12-math-lp-p1-short-009

✅ Step-by-Step Solution

Final Answer: max Z=40 at (0,5).
  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,5), (3,2).
  3. Evaluate the objective at every vertex: (0,5) → 40; (3,2) → 31.
  4. The region is bounded. max Z=40 at (0,5).

📋 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,5), (3,2).
  • [1 mark] Evaluate the objective at every vertex: (0,5) → 40; (3,2) → 31.
  • [0.5 marks] The region is bounded. max Z=40 at (0,5).

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
Maximize Z=300*x + 190*y subject to x + y ≤ 24; 2*x + y ≤ 32; -x ≤…
Next Question →
Maximize Z=20*x + 10*y subject to 3*x + 6*y ≤ 84; 3*x + y ≤ 24; -x ≤…

More Practice Questions in Linear Programming

Related Questions in Linear Programming