

CBSE Class 12 Sample Paper for 2026 Boards
CBSE Class 12 Sample Paper for 2026 Boards
Last updated at August 26, 2025 by Teachoo
Transcript
Question 17 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 (5, 0). Then one of the other possible points at which the objective function attains its minimum value is (A) (2,9) (B) (6,6) (C) (4,7) (D) (0,0) Usually, when Z attains minimum value at more than one point It would attain minimum value at all points in the line So, that means if (5, 0) has minimum value of Z, and (5, 0) passes through red line Then all points on the red line will have minimum value of Z From our options (A) (2,9) (B) (6,6) (C) (4,7) (D) (0,0) Now, (2, 9) is on red line So, the correct answer is (A)