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

Class 12 Maths · Linear Programming · Long Answer #30

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

✅ Step-by-Step Solution

Final Answer: max Z=3200 at (8,20).
  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,25), (8,20), (24,0).
  3. Evaluate the objective at every vertex: (0,0) → 0; (0,25) → 3000; (8,20) → 3200; (24,0) → 2400.
  4. The region is bounded. max Z=3200 at (8,20).

📋 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,25), (8,20), (24,0).
  • [1 mark] Evaluate the objective at every vertex: (0,0) → 0; (0,25) → 3000; (8,20) → 3200; (24,0) → 2400.
  • [0.5 marks] The region is bounded. max Z=3200 at (8,20).

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=80*x + 120*y subject to 3*x + 4*y ≤ 60; x + 3*y ≤ 30; -x…
Next Question →
Maximize Z=3*x + 9*y subject to -x - y ≤ -10; x + 3*y ≤ 60; x - y ≤…

More Practice Questions in Linear Programming

Related Questions in Linear Programming