Practice Problem Set 4
(Revised Simplex, Duality Theory and Sensitivity Analysis)
Use the concept of the Revised Simplex to solve problems (1) to (3).
(1) Consider the following problem.
You are given the facts that the basic variables in the optimal solution are x3, x1, and x5 and that
(a) Use the given information to identify the optimal solution.
(b) Use the given information to identify the shadow prices for the three resources.
(2) Consider the following problem.
Let x4, x5, and x6 denote the slack variables for the respective constraints. After you apply the simplex
method, a portion of the final simplex tableau is as follows:
Identify the missing numbers in the final simplex tableau. Show your calculations.
(3) Consider the following problem.
Let x4, x5, x6, and x7 denote the slack variables for the first through fourth constraints, respectively.
Suppose that after some number of iterations of the simplex method, a portion of the current simplex
tableau is as follows:
Identify the missing numbers in the current simplex tableau. Show your calculations.
(4) Consider the following problem.
(a) Construct the dual problem.
(b) Use duality theory to show that the optimal solution for the primal problem has Z ≤ 0.
(5) Consider the following problem.
The corresponding final set of equations yielding the optimal solution is
(a) Identify the optimal solution from this set of equations.
(b) Construct the dual problem.
(c) Identify the optimal solution for the dual problem from the final set of equations. Verify this
solution by solving the dual problem graphically.
(d) Suppose that the original problem is changed to
Use duality theory to determine whether the previous optimal solution is still optimal.
(e ) Now suppose that the only change in the original problem is that a new variable xnew has been
introduced into the model as follows:
Use duality theory to determine whether the previous optimal solution, along with xnew = 0, is still
optimal.
(6) Consider the following problem.
Let x4, x5, and x6 denote the slack variables for the respective constraints. After we apply the
simplex method, the final simplex tableau is
1. Find the range of value of c1, c2 and c3 for which the current basis (solution) is optimal.
2. Find the range of value of b1, b2 and b3 for which the current basis is feasible.
3. Now you are to conduct sensitivity analysis by independently investigating each of the
following six changes in the original model. For each change, use the sensitivity analysis
procedure to revise this final tableau and convert it to proper form from Gaussian
elimination for identifying and evaluating the current basic solution. Then test this solution
for feasibility and for optimality. If either test fails, reoptimize to find a new optimal
solution.
(a) Change the right-hand sides
(b) Change the coefficients of x1
(c) Change the coefficients of x3
(d) Change the objective function to Z = 3x1 ˗ 2x2 + 3x3.
(e) Introduce a new constraint 3x1 ˗ 2x2 + x3 ≤ 30. (Denote its slack variable by x7.)
(f) Introduce a new variable x8 with coefficients
