Consider the following linear programming problem: Maximize 20X + 30Y
Subject to: X + Y ≤ 80
12X + 12Y ≤ 600
3X + 2Y ≤ 400
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.

Question

Quizplus · Accepted Answer

The constraint 12X + 12Y ≤ 600 can be simplified to X + Y ≤ 50, which is stricter than the constraint X + Y ≤ 80, making the latter redundant. The problem can still be solved graphically, and there's no indication of no feasible solution or multiple optimal solutions without further analysis.

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