Mathbee CBSE Mathbee · CBSE Class 12 Maths
NCERT Class 12 · Ch 12 Exercise 12.1 · Q8

NCERT Class 12 Maths · Chapter 12 Linear Programming · Exercise 12.1 Question 8

Minimize and maximize Z=x+2y subject to x+2y≥100,2x−y≤0,2x+y≤200,x,y≥0. Solve graphically.
Graphical construction for exercise 12.1 question 8
Graphical construction for exercise 12.1 question 8

💡 Concept Hints

  1. Convert the inequalities to boundary lines and identify the common feasible region.
  2. Evaluate the objective at all feasible vertices, then check directions of escape if the region is unbounded.

✅ Step-by-Step Solution

Final Answer: Minimum Z=100 at (0,50), (20,40) and every point of the segment joining these vertices. Maximum Z=400 at (0,200).
  1. Plot each boundary and intersect its indicated closed half-plane with x,y≥0.
  2. Solving boundary pairs and checking every inequality gives vertices (0,50), (0,200), (20,40), (50,100).
  3. The objective values at these vertices are (0,50) → 100; (0,200) → 400; (20,40) → 100; (50,100) → 250.
  4. The region is bounded. The corner-point theorem applies. If two vertices share an optimal value, linearity gives the same value on their whole joining segment.
  5. Minimum Z=100 at (0,50), (20,40) and every point of the segment joining these vertices. Maximum Z=400 at (0,200).

Master Chapter 12: Linear Programming

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
📘 Chapter Notes & All Exercises 🚀 Open Interactive Workspace →
← Previous Question
Minimize and maximize Z=5x+10y subject to…
Next Question →
Maximize Z=−x+2y subject to x≥3,x+y≥5,x+2y≥6,y≥0. Solve graphically.

All Questions in Linear Programming — Exercise 12.1

Related Questions in Linear Programming