Consider the Following Linear Programming Problem: Maximize 10X + 30Y

Multiple Choice

Consider the following linear programming problem: Maximize 10X + 30Y
Subject to: X + 2Y ≤ 80
8X + 16Y ≤ 640
4X + 2Y ≥ 100
X, Y ≥ 0
This is a special case of a linear programming problem in which

A) there is no feasible solution.
B) there is a redundant constraint.
C) there are multiple optimal solutions.
D) this cannot be solved graphically.