CBSE Class 12 Mathematics sample paper 2025-26: question 17
From the official CBSE sample question paper for 2025-26, section A, question 17, for 1 mark. Try it first; the hints and our step-by-step solution are below.
Q17 · 1 mark · MCQLinear Programming
The feasible region of a linear programming problem is bounded but the objective function attains its minimum value at more than one point. One of the points is .
Then one of the other possible points at which the objective function attains its minimum value is
- (A)
- (B)
- (C)
- (D)
Figure in the paper: Graph with a shaded bounded feasible region in the first quadrant: a triangle-like region with vertices near (5,0), (10,0) and (0,16), bounded by two lines (one through (5,0) and (0,16), another steeper line) and the x-axis. See it in the official paper.
Source: official sample paper from cbseacademic.nic.in (PDF). See it in the full Sample paper 2025-26.
Hints
Open one hint at a time and try again before the next.
Hint 1
When the optimum occurs at two points, it occurs on the whole segment joining them.
Hint 2
Which option lies on the boundary line through ?
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.
If the minimum occurs at more than one point, it occurs all along a boundary edge. The edge through and is .
- 1 mark
satisfies , so it lies on that edge. Option (A).
Answer: , option (A)
Where the marks are
- Identifies the edge through and checks that lies on it (1 mark)
Revise the chapter
- Chapter: Linear Programming (notes, formulas, where marks are lost and every past question)
More questions from Linear Programming
- Sample paper 2025-26, Q30 · 3 marksSolve graphically: Maximise Z=2x+y subject to x+y≤1200 x+y≥600 y/2 x≥0, y≥0.
- 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…
- 2025 board paper, set 65/7/1, Q24 · 2 marksIn a Linear Programming Problem, the objective function Z = 5x + 4y needs to be maximised under constraints 3x…
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.