Q: Consider the following LPP
(a) Solve using simplex method.
(b) Hence, using the sensitivity analysis, find the new optimal solution of the LPP if the availability of the second constraint is changed from 11 to 15.
Q: Consider the following LP
.gif)
(a) Using M-method solve the above LP. Does the problem has alternative optimal solution? If so, find all the alternative optimal solutions.
(b) Write the dual of the above problem. Also, write the optimal solution of the dual problem (from the optimal table of part (a)).
(c) What can you conclude regarding the relationship of solution of primal and dual problems?
Q: The following is an optimal LP tableau:
| Basic |
 |
 |
 |
 |
 |
 |
Solution |
 |
1 |
0 |
0 |
0 |
3 |
2 |
? |
 |
0 |
0 |
0 |
1 |
1 |
-1 |
2 |
 |
0 |
0 |
1 |
0 |
1 |
0 |
6 |
 |
0 |
1 |
0 |
0 |
-1 |
1 |
2 |
The variables x
3, x
4 and x
5 are slacks in the original problem. Using matrix manipulations, reconstruct the original LP, and then compute the optimum objective value. Also, compute the optimum objective value by using dual objective function.