The linear programming problem :
Maximize $Z= x+y ,$
subject to the constraints $x-y ≤-1, -x + y ≤ 0, x, y ≥ 0$ has
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → no feasible solution
Region unbounded
⇒ No feasible solution