CBSE 2026 · Region 5 · Set 1 · Q20 · 1 mark

Assertion (A) : Consider a Linear Programming Problem with minimise $\displaystyle \mathrm{Z}=\mathrm{x}+2 \mathrm{y}$ subject to constraints $\displaystyle 2 \mathrm{x}+\mathrm{y} \geq 3, \mathrm{x}+2 \mathrm{y} \geq 6$, $\displaystyle \mathrm{x}, \mathrm{y} \geq 0$ which gives minimum Z at infinitely many points. The corner points of feasible region are $\displaystyle (0,3)$ and $\displaystyle (6,0)$. Reason (R): If two corner points produce the same minimum value of the objective function, then every point on the line segment joining the points will give the same minimum value.

CBSE Class 12 Mathematics past-paper question from the 2026board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.