The feasible region represented by the constraints of the linear programming problem:
\(x+y \le 6,\ y \le 7,\ x \ge 4,\ x, y \ge 0\) is:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → Bounded in quadrant I
Since \(x \ge 4\), the constraint \(x + y \le 6\) gives
\(y \le 6 - x \le 6 - 4 = 2\)
So the constraint \(y \le 7\) is redundant, and the region is cut out by the lines x = 4, y = 0 and x + y = 6.
Corner points:
\(x = 4\) and \(y = 0\) meet at \((4, 0)\)
\(x + y = 6\) and \(y = 0\) meet at \((6, 0)\)
\(x = 4\) and \(x + y = 6\) meet at \((4, 2)\)
The feasible region is the triangle with these three vertices, so it is bounded. Every point of it has \(x \ge 4 \gt 0\) and \(y \ge 0\), so it lies in quadrant I.