Consider the following problem.

Maximize Z 4x1  3x2  x3  2x4, subject to 4x1  2x2  x3  x4 5 3x1  x2  2x3  x4 4 and x1  0, x2  0, x3  0, x4  0.

Let 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