Consider the LPP
Min \(Z=x-y\), subject to the conditions
\(x+y \le 3\),
\(y-x \ge 1\),
\(x \ge 0,\ y \ge 0\), then the minimum value of the objective function exists at the point:
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → (0, 3)
The boundary lines x + y = 3 and y − x = 1 meet where
\(2y = 4,\quad y = 2,\quad x = 1\)
On the y-axis (x = 0) the constraints give \(y \ge 1\) and \(y \le 3\). So the feasible region is the triangle with corner points (0, 1), (0, 3) and (1, 2).
Values of Z = x − y at the corner points:
\(Z(0, 1) = 0 - 1 = -1\)
\(Z(0, 3) = 0 - 3 = -3\)
\(Z(1, 2) = 1 - 2 = -1\)
The smallest value, −3, is at (0, 3).
Why the other options are incorrect
Option (2) (3, 0) — Incorrect. Here y − x = −3, which is not \(\ge 1\), so the point is not feasible.
Option (3) (1, 2) — Incorrect. It is a corner point, but Z = −1 there, more than −3.
Option (4) (2, 1) — Incorrect. Here y − x = −1, which is not \(\ge 1\), so the point is not feasible.