CBSE Class 12 Mathematics 2024: question 35
Set in the CBSE Class 12 board exam of 2024, paper 65/5/1, section D, question 35, for 5 marks. Try it first; the hints and our step-by-step solution are below.
Q35 · 5 marks · Long answerLinear Programming
Solve the following L.P.P. graphically :
Maximise
Subject to , , ,
Source: official question paper from cbse.gov.in (PDF). See it in the full 2024 board paper, set 65/5/1.
Hints
Open one hint at a time and try again before the next.
Hint 1
Plot each constraint line using its intercepts, then decide which side of each line is feasible.
Hint 2
The constraint cuts off the region near the origin; find where and intersect.
Hint 3
Evaluate Z at every corner point of the bounded region and compare the values.
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. Draw the boundary lines:
- through and
- through and
- through and
Shade the region that satisfies all the constraints:
- below and below
- above
- in the first quadrant
The two lines and meet at . The feasible region is bounded, with corner points , , , and .
- 1 mark
Evaluate at each corner point:
Corner point 160 240 400 360 300 - ½ mark
The largest value in the table is at . Hence the maximum value of is , at .
Answer: Max at
Where the marks are
- Correct graph with the feasible region shaded and corner points (3½ marks)
- Table of Z values at the corner points (1 mark)
- Conclusion: max Z = 400 at (4,4) (½ mark)
Revise the chapter
- Chapter: Linear Programming (notes, formulas, where marks are lost and every past question)
More questions from Linear Programming
- 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…
- 2023 board paper, set 65/1/1, Q29 · 3 marksSolve graphically the following linear programming problem : Maximise z = 6x + 3y, subject to the constraints …
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.