Question: Consider the following linear programming model: Max X1 + 3X2 Subject to: X1 + X2 5 X1 1 X2 3 X1 2 X1, X2 0
Consider the following linear programming model:
Max X1 + 3X2
Subject to:
X1 + X2 5
X1 1
X2 3
X1 2
X1, X2 0
This linear programming model has:
| A. | alternate optimal solution | |
| B. | unbounded solution | |
| C. | redundant constraint | |
| D. | infeasible solution | |
| E. | none of the above |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
