Target Exam

CUET

Subject

-- Mathematics - Section A

Chapter

Linear Programming

Question:

Consider the LPP: Minimize $Z = x + 2y$ subject to $2x + y ≥3,x + 2y ≥ 6, x, y ≥ 0$. The optimal feasible solution occurs at

Options:

(6, 0) only

(0, 3) only

Neither (6, 0) nor (0, 3)

Both (6, 0) and (0, 3)

Correct Answer:

Both (6, 0) and (0, 3)

Explanation:

The correct answer is Option (4) → Both (6, 0) and (0, 3)

Constraints

$2x+y\ge 3$

$x+2y\ge 6$

$x\ge 0,\;y\ge 0$

Corner points: $(0,3)$ and $(6,0)$

Compute $Z=x+2y$

$Z(0,3)=6$

$Z(6,0)=6$

The optimal feasible solutions occur at both $(0,3)$ and $(6,0)$.