CBSE Class 12 Mathematics 2025: question 27
Set in the CBSE Class 12 board exam of 2025, paper 65/1/1, section C, question 27, for 3 marks. Try it first; the hints and our step-by-step solution are below.
Q27 · 3 marks · Short answerLinear Programming
Solve the following linear programming problem graphically :
Maximise
Subject to the constraints:
Source: official question paper from cbse.gov.in (PDF). See it in the full 2025 board paper, set 65/1/1.
Hints
Open one hint at a time and try again before the next.
Hint 1
Shade each inequality by testing a point such as or the origin, then find where the two slanted lines meet.
Hint 2
The feasible region is unbounded. After finding Z at the corners, check whether has points in common with the region.
Step-by-step solution
Each step shows the marks it earns, as an examiner would award them. Checked by an independent re-solve from the question paper.
- 1½ marks
Graph. Draw the lines (through and ) and (through and ). The region lies on and below . The region lies on and below (the origin satisfies it). Together with , the feasible region lies above the -axis, under from to , and under beyond . It is unbounded. The lines and meet where , i.e. at . So the corner points are and .
- 1 mark
Values of Z at the corner points
Corner point 0 6 - ½ mark
The largest value at a corner is 6, but the region is unbounded. Draw the open half-plane (boundary line through and ). It has points in common with the feasible region, e.g. gives . Hence has no maximum value.
Answer: Corner points O(0,0) and A(2,2) give Z = 0 and 6. The feasible region is unbounded and meets it, so Z has no maximum value.
Where the marks are
- Correct graph of the constraints with the unbounded feasible region shaded and corner point A(2,2) (1½ marks)
- Correct table of Z at the corner points O and A (1 mark)
- Checks the half-plane and concludes there is no maximum (½ mark)
Revise the chapter
- Chapter: Linear Programming (notes, formulas, where marks are lost and every past question)
More questions from Linear Programming
- 2024 board paper, set 65/5/1, Q35 · 5 marksSolve the following L.P.P. graphically : Maximise Z=60x+40y Subject to x+2y≤12, 2x+y≤12, 4x+5y≥20, x,y≥0
- Sample paper 2023-24, Q30(a) · 3 marksSolve the following Linear Programming Problem graphically: Minimize: z=x+2y, subject to the constraints: x+2y…
- Sample paper 2023-24, Q30(b) · 3 marksSolve the following Linear Programming Problem graphically: Maximize: z=-x+2y, subject to the constraints: x≥3…
The question is transcribed from the official paper; figures are described in words. The solution, hints and chapter tag are ours. Spotted an error? Write tosupport@questionbuddy.in.