Question: You are given the following simplex table for a maximization problem. Z X 1 X 2 X 3 X 4 RHS 1 c 1 0
You are given the following simplex table for a maximization problem.
| Z | X1 | X2 | X3 | X4 | RHS |
| 1 | c1 | 0 | 0 | 0 | 10 |
| 0 | a1 | 1 | 0 | -2 | b |
| 0 | -5 | 0 | 1 | 1 | 2 |
Give conditions on the unknowns a1, b, and c1 that makes the following statements true. (Fill the table below)
- The current solution is not a basic feasible solution (infeasible).
- The current solution is optimal, and there are alternative optimal solutions.
- The LP is unbounded.
|
| a1 | b | c1 |
| Infeasible
|
|
|
|
| Alternative Optimal |
|
|
|
| Unbounded
|
|
|
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
