Consider the following problem.

Maximize Z 2x1  x2  x3, subject to 3x1  x2  x3 60 x1  x2  2x3 10 x1  x2  x3 20 and x1  0, x2  0, x3  0.

After slack variables are introduced and then one complete iteration of the simplex method is performed, the following simplex tableau is obtained.

222 5 THE THEORY OF THE SIMPLEX METHOD

(a) Identify the CPF solution obtained at iteration 1.

(b) Identify the constraint boundary equations that define this CPF solution.