CBSE Class 12 Mathematics 2026 Main Paper 65/2/1 · Q303 Markscorner_point_method
CBSE Class 12 Mathematics 2026 Main Paper 65/2/1 · Question 30 (Linear Programming)
Graphically maximize Z=10500x+9000y for x+y≤50, 2x+y≤80 and x,y≥0.
✅ Step-by-Step Solution
Final Answer: 495000 at (30,20).
- Plot both boundary lines. Keep their common lower side in the first quadrant.
- The vertices are (0,0), (40,0), (30,20) and (0,50). The respective objective values are 0, 420000, 495000 and 450000.
- The maximum is 495000 at (30,20).
📋 CBSE Stepwise Marking Scheme
- [0.5 marks] Plot both boundary lines. Keep their common lower side in the first quadrant.
- [2 marks] The vertices are (0,0), (40,0), (30,20) and (0,50). The respective objective values are 0, 420000, 495000 and 450000.
- [0.5 marks] The maximum is 495000 at (30,20).
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
← Previous Question
Solve \(xy\prime=y-x\sin^2(y/x)\), given \(y(1)=\pi/6\). OR Solve…
Next Question →On a stormy day a sniper is three times as likely to hit as to miss…
All Questions in CBSE Class 12 Mathematics 2026 Main Paper 65/2/1
Related Questions in Linear Programming
Class 12 Linear Programming · Mcq Single Correct
How many feasible solutions satisfy 3x+y≤12, x+2y≤10, x,y≥0?
Class 12 Linear Programming · Mcq Single Correct
The shaded first-quadrant region lies above both x+2y=4 and x+y=3. Which constraints describe…
Class 12 Linear Programming · Mcq Single Correct
Z=ax+by has maximum 42 at (4,6) and minimum 19 at (3,2). Find a,b.
Class 12 Linear Programming · Mcq Single Correct
A bounded feasible polygon has vertices (2,72),(15,20),(40,15). For Z=18x+9y, select the…
Class 12 Linear Programming · Mcq Single Correct
How many vertices does x−y≥0, 2y≤x+2, x,y≥0 have?
Class 12 Linear Programming · Mcq Single Correct
A bounded feasible polygon has vertices (0,3),(3,2),(0,5). Find the minimum of Z=11x+7y.