Work through the revised simplex method step by step to solve each of the following models:

(a) Model given in Prob. 3.1-5.

(b) Model given in Prob. 4.7-8.

D 5.3-1.* Consider the following problem.

Maximize Z x1  x2  2x3, subject to 2x1  2x2  3x3 5 x1  x2  x3 3 x1  x2  x3 2 and x1  0, x2  0, x3  0.
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:

(a) Use the fundamental insight presented in Sec. 5.3 to identify the missing numbers in the final simplex tableau. Show your calculations.

(b) Identify the defining equations of the CPF solution corresponding to the optimal BF solution in the final simplex tableau.
D