Consider the following problem.

Maximize Z 20x1  6x2  8x3, subject to 8x1  2x2  3x3 200 4x1  3x2  3x3 100 2x1  3x2  x3 50 2x1  3x2  x3 20 and x1  0, x2  0, x3  0.

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:

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

(b) Indicate which of these missing numbers would be generated by the revised simplex method in order to perform the next iteration.

(c) Identify the defining equations of the CPF solution corresponding to the BF solution in the current simplex tableau.

D