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 3
The correct answer is Option (3) → no feasible solution
The region \(3x + 5y \le 15,\ x \ge 0,\ y \ge 0\) is the triangle with corners (0, 0), (5, 0) and (0, 3). The largest value of x + y on it is at a corner:
\((0, 0):\ x + y = 0\)
\((5, 0):\ x + y = 5\)
\((0, 3):\ x + y = 3\)
So every point of this triangle has \(x + y \le 5\), and none can satisfy \(x + y \ge 8\). The same follows without a graph: for \(y \ge 0\),
\(3(x + y) \le 3x + 5y \le 15\)
\(x + y \le 5\)
No point satisfies all the constraints, so the feasible region is empty. The problem has no feasible solution, whatever the objective function.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
