Consider the following problem.
Maximize Z = 20x1 + 6x2 + 8x3,
Subject to

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 matrix form of the simplex method to perform the next iteration.

Transcribed Image Text:

8x1 + 2x2 + 3x3 s: 200 4x 3x2100 2x 50 Ху 20 Coefficient of: Right Variable Eq.Z1 X2 X3 X4 X5 X6 X7 Side Basic (0) 1 9 4 2 16 8 X2 (2) 0 x6 X7 (3) 0 (4) 0 4