CBSE Class 12 Mathematics 2023: question 34
Set in the CBSE Class 12 board exam of 2023, paper 65/5/1, section D, question 34, for 5 marks. Try it first; the hints and our step-by-step solution are below.
Q34 · 5 marks · Long answerLinear Programming
Solve the following Linear Programming Problem graphically :
Maximize :
subject to : , ,
Source: official question paper from cbse.gov.in (PDF). See it in the full 2023 board paper, set 65/5/1.
Hints
Open one hint at a time and try again before the next.
Hint 1
Find the intercepts of each line and on both axes, then decide which side of each line to shade using the origin.
Hint 2
Check where the two lines intersect. One constraint may lie entirely inside the other in the first quadrant.
Hint 3
List the corner points of the shaded region and substitute each into .
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.
- 3 marks
Graph of the constraints. Draw each constraint line and shade the side that satisfies the inequality.
- Line passes through and . The point gives , so we shade the origin side.
- Line passes through and . Again we shade the origin side.
- restricts the region to the first quadrant.
Both lines meet the -axis at the same point : subtracting the equations gives , so .
For we have . So the second constraint is automatically satisfied.
The feasible region is therefore the bounded triangle with vertices , and . It is shaded in the first quadrant below the line .
- 1½ marks
Corner point method. Evaluate at each vertex of the feasible region.
Corner point (maximum) - ½ mark
The feasible region is bounded, so the maximum occurs at a corner point.
Hence the maximum value of is , attained at .
Answer: Maximum P = 210 at x = 3, y = 0
Where the marks are
- Correct graph of both lines with the feasible triangle O(0,0), B(0,4.5), C(3,0) correctly shaded (3 marks)
- Table of corner points with values of P: 0, 180, 210 (1½ marks)
- States maximum P = 210 at (3, 0) (½ mark)
Revise the chapter
- Chapter: Linear Programming (notes, formulas, where marks are lost and every past question)
More questions from Linear Programming
- Sample paper 2026-27, Q31 · 3 marksSolve the linear programming problem graphically: Maximize Z=40x+30y Subject to constraints: x+y≤6, 2x≥ y, y≥2
- 2025 board paper, set 65/1/1, Q27 · 3 marksSolve the following linear programming problem graphically : Maximise Z=x+2y Subject to the constraints: x-y≥0…
- 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
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.