The linear programming problem : Maximize $Z= x+y ,$ subject to the constraints $x-y ≤-1, -x + y ≤ 0, x, y ≥ 0$ has

feasible solution at (0, 0) no feasible solution infinite number of feasible solutions feasible solutions at the points (1, 1) and (0, 1)

no feasible solution

The correct answer is Option (2) → no feasible solution Region unbounded ⇒ No feasible solution