The maximum value of the linear programming problem, max. \( z=3x+4y \),
subject to the constraints:
\( x-y\le -1,\ x\ge y,\ x,y\ge 0 \) is
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → maximum value does not exist
The first constraint gives \( y\ge x+1 \), so y is greater than x. The second says \( x\ge y \). Both cannot hold together.
So no point satisfies all the constraints: the feasible region is empty, and z has no maximum value.