MonoMath CBSE
CBSE Maths › Class 12 PYQs › Linear Programming

Linear Programming: 2 marks Questions (CBSE Class 12)

3 different 2 marks questions on Linear Programming from CBSE Class 12 Maths board exams 2024–2026, newest first.

1 mark (25)2 marks (3)3 marks (29)4 marks (1)5 marks (6)
Q242 marksVery Short AnswerLinear ProgrammingCBSE 2025 · 65/7/1

In a Linear Programming Problem, the objective function needs to be maximised under constraints , , . Express the LPP on the graph and shade the feasible region and mark the corner points.

Show answer & solution
Answer: Feasible region is the quadrilateral with corner points (0, 0), (1, 0), (1, 3) and (0, 6); (maximum Z = 24 at (0, 6)).
  1. Draw the lines (through (2, 0) and (0, 6)) and .
  2. The feasible region lies on the origin side of both lines in the first quadrant.
  3. meets at (1, 3).
  4. Corner points: O(0, 0), A(1, 0), B(1, 3), C(0, 6); shade OABC.
  5. Z at these points: 0, 5, 17, 24, so the maximum is 24 at (0, 6).
Q242 marksVery Short AnswerLinear ProgrammingCBSE 2025 · 65/7/2

In a Linear Programming Program (LPP) for objective function
subject to constraints



shade the feasible region and mark the corner points in a neatly drawn graph.

Show answer & solution
Answer: Feasible region is the quadrilateral with corner points (0, 0), (8, 0), (2, 6) and (0, 3).
  1. Draw through (8, 0) and (0, 8); draw through (−2, 0) and (0, 3).
  2. (0, 0) satisfies both inequalities, so the feasible region is on the origin side of both lines, in the first quadrant.
  3. The lines meet where , i.e. , .
  4. Corner points: (0, 0), (8, 0), (2, 6), (0, 3); shade the quadrilateral formed by them.
Q242 marksVery Short AnswerLinear ProgrammingCBSE 2025 · 65/7/3

For a Linear Programming Problem, find min (where Z is the objective function) for the feasible region shaded in the given figure.
(Note : The figure is not to scale)

Diagram for CBSE 2025 Class 12 Maths question 24
Show answer & solution
Answer: Minimum Z = 9 at C(0, 3)
  1. B is where meets the y-axis: B(0, 5); C is where meets the y-axis: C(0, 3).
  2. A: solving and gives , so A(3, 2).
  3. Z at B = 15, at C = 9, at A = 15 + 6 = 21.
  4. The region is bounded, so min Z = 9 at C(0, 3).
← Three Dimensional Geometry Probability →
Practise smarter: chapter-wise revision, formula sheets and step-by-step NCERT solutions on MonoMath CBSE →