Consider the following linear programming problem: Maximize Z = 20X1 + 30X2 Subject to:       X1 + X2 =< 80 8X1 + 9X2 =< 600 3X1 + 2X2 => 400 X1,X2 => 0 This is a special case of a linear programming problem in which: there is no feasible solution

Subject:Electrical EngineeringPrice:3.87 Bought7

Share With

Consider the following linear programming problem:

Maximize Z = 20X1 + 30X2

Subject to:       X1 + X2 =< 80

8X1 + 9X2 =< 600

3X1 + 2X2 => 400

X1,X2 => 0

This is a special case of a linear programming problem in which:

1. 1. there is no feasible solution.
   2. there is a redundant constraint.
   3. there are multiple optimal solutions.
   4. this cannot be solved graphically.
   5. none of the above.