Consider the following problem.

Maximize Z = x₁ – x₂ + 2x₃,

Subject to

and

x₁ ≥ 0, x₂ ≥ 0, x₃ ≥ 0

Let x₄, x₅, and x₆ 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.

2 2r2 +3x35 Coefficient of: Right VariableEq. Z12x XXs X Side Basic (0) 1 EB 1 (1) (2) 0 (3) 0 X3