Linear programming problems with redundant constraints.
Consider the following linear programming problem:
Maximize Subject to:
10X + 30Y
X + 2Y ≤ 80
8X + 16Y ≤ 640
4X 2Y ≥ 100
X Y ≥ 0
1. This is a special case of a linear programming problem in which
2. There is no feasible solution.
3. There is a redundant constraint.
4. There are multiple optimal solutions.
5. This cannot be solved graphically
6. None of these.