Question: Considering the following final simplex tableau for a product-mix maximizing problem: 4 3 0 0 C Pmix Quan X1 X2 S1 S2 4 X1 3/2
Considering the following final simplex tableau for a product-mix maximizing problem:
| 4 | 3 | 0 | 0 | |||
| C | Pmix | Quan | X1 | X2 | S1 | S2 |
| 4 | X1 | 3/2 | 1 | 0 | -1/4 | 3/4 |
| 3 | X2 | 1 | 0 | 1 | 1/2 | -1/2 |
| Z | 9 | 4 | 3 | 0.5 | 1.5 | |
| C-Z | 0 | 0 | -0.5 | -1.5 |
Required:
- Find the integer programming solution to this problem by conducting Gromory cutting plane Method then Explain briefly each coefficient computed. Why should such concept be used? Explain briefly.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
