A. The problem is infeasible
B. The solution is unbounded
C. One of the constraints is redundant
D. None of the above
✅ The correct answer is option A.
If two constraints do not intersect in the positive quadrant of the graph, then the problem is infeasible.
If two constraints do not intersect in the positive quadrant of the graph, then the problem is infeasible.