The linear programming problem:
Maximize \(Z= x+y\),
subject to the constraints \(x-y \le -1, -x + y \le 0, x, y \ge 0\) has
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → no feasible solution
A feasible solution is a point that satisfies all the constraints together. Rewriting the first two constraints:
\(x - y \le -1 \Rightarrow y \ge x + 1\)
\(-x + y \le 0 \Rightarrow y \le x\)
Both together would need
\(x + 1 \le y \le x\)
which is impossible, because x + 1 is always greater than x.
So no point satisfies the constraints: the feasible region is empty and the problem has no feasible solution.
Why the other options are incorrect
Option (1) feasible solution at (0, 0) — Incorrect. At (0, 0), x − y = 0, which is not ≤ −1.
Option (3) infinite number of feasible solutions — Incorrect. No point at all satisfies the first two constraints together.
Option (4) feasible solutions at the points (1, 1) and (0, 1) — Incorrect. At (1, 1), x − y = 0, which is not ≤ −1; at (0, 1), −x + y = 1, which is not ≤ 0.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
