Question: The following tableau represents a specific simplex iteration for a minimization problem. Z x 1 x 2 x 3 s 1 s 2 s 3
The following tableau represents a specific simplex iteration for a minimization problem.
| Z | x1 | x2 | x3 | s1 | s2 | s3 | RHS |
| 1 | 0 | a | 0 | -3 | -5 | 0 | 15 |
| 0 | 0 | 0 | 1 | 1 | 0 | b | 3 |
| 0 | 1 | d | 0 | 1 | 2 | 0 | 5 |
| 0 | 0 | -3 | 0 | -2 | 6 | 1 | c |
1) make the current feasible solution optimal
2) allow x2 to enter the basis to improve the value of z.
3) indicate that the problem is unbounded.
4) indicate alternate optimal solutions.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
