The linear programming problem:
Minimise \(Z=3x+2y\)
Subject to the constraints
\(x+y \ge 8\)
\(3x+5y \le 15\)
\(x \ge 0,\ y \ge 0\) has
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → no feasible solutions
The constraint \(3x + 5y \le 15\) with \(x, y \ge 0\) gives the triangle with corners (0, 0), (5, 0) and (0, 3). On this triangle the largest value of x + y is at a corner:
\((0, 0):\ 0\)
\((5, 0):\ 5\)
\((0, 3):\ 3\)
So \(x + y \le 5\) at every point satisfying the other constraints, and \(x + y \ge 8\) can never hold. No point satisfies all the constraints: the feasible region is empty, and the problem has no feasible solution.
For the same reason there is no bounded region (Option 3), and (0, 0) fails x + y ≥ 8 (Option 4).
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
