Mathbee CBSE Mathbee · CBSE Class 12 Maths
CBSE Class 12 Mathematics 2026 Supplementary Paper 65(B)/7 · Q313 Markscorner_point_method

CBSE Class 12 Mathematics 2026 Supplementary Paper 65(B)/7 · Question 31 (Linear Programming)

Find the maximum and minimum of Z=4x+3y on the bounded feasible region with corners (25,0),(16,16),(0,24).

✅ Step-by-Step Solution

Final Answer: Maximum 112 at (16,16); minimum 72 at (0,24).
  1. Use the corner-point theorem.
  2. The three objective values are 100,112,72.
  3. Read off the extrema and their vertices.

📋 CBSE Stepwise Marking Scheme

  • [0.5 marks] Use the corner-point theorem.
  • [2 marks] The three objective values are 100,112,72.
  • [0.5 marks] Read off the extrema and their vertices.

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
Solve (3xy+y²)dx+(x²+xy)dy=0. OR Solve x(1+y²)dx−y(1+x²)dy=0 through…
Next Question →
On ordered pairs of positive natural numbers define (a,b)R(c,d) when…

All Questions in CBSE Class 12 Mathematics 2026 Supplementary Paper 65(B)/7

Related Questions in Linear Programming