You are using the simplex method to solve the following linear programming problem.

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

You have obtained the following final simplex tableau where x5 and x6 are the slack variables for the respective constraints.

Use the fundamental insight presented in Sec. 5.3 to identify Z*, b*1, and b*2. Show your calculations.

D