Mathematics Linear Programming 1 Mark
Appeared in: 2025, 2026 (3 sets)
Questions number 19 and 20 are Assertion and Reason based questions. Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select the correct answer from the codes (A), (B), (C) and (D) as given below. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true. Assertion (A) : Consider a Linear Programming Problem with minimise $Z = x + 2y$ subject to constraints $2x + y \ge 3$, $x + 2y \ge 6$, $x, y \ge 0$ which gives minimum $Z$ at infinitely many points. The corner points of feasible region are $(0, 3)$ and $(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.