CBSE Class 12 Mathematics 2026 Main Paper 65/5/3 · Q313 Markscorner_point_method
CBSE Class 12 Mathematics 2026 Main Paper 65/5/3 · Question 31 (Linear Programming)
Graphically maximize Z=2x/5+3y/10 subject to 2x+y≤1000, x+y≤800 and x,y≥0.
✅ Step-by-Step Solution
Final Answer: 260 at (200,600).
- Plot both boundary lines and retain the first-quadrant area below both.
- The corners (0,0),(500,0),(200,600),(0,800) give Z=0,200,260,240.
- Thus the maximum is 260 at (200,600).
📋 CBSE Stepwise Marking Scheme
- [0.5 marks] Plot both boundary lines and retain the first-quadrant area below both.
- [2 marks] The corners (0,0),(500,0),(200,600),(0,800) give Z=0,200,260,240.
- [0.5 marks] Thus the maximum is 260 at (200,600).
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
← Previous Question
Evaluate \(\int (x-\sin x)\,dx/(1-\cos x)\). OR Evaluate \(\int_0^2…
Next Question →One art, story and puzzle book each cost ₹21 in total. Four art…
All Questions in CBSE Class 12 Mathematics 2026 Main Paper 65/5/3
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.