The optimal simplex table for the following LP model is shown below: Objective function: Max = 4x1 + 3x2 + 5x3 Subject to: 1x1 + 2x2 + 3x3  9 2x1 + 3x2 + 1x3  12 x1, x2, x3  0

(a) If you consider the change in one of the values on the right side, say b1, what is the allowed range such that the table itself is the optimal table? (b) When b1 = 40, what would be the optimal solution?

Iteration-3 4 3 5 0 0 CG XR B CA 2. S S. 3 S 1.2 0 0.2 | 0.4 -0.2 I 4 5.4 1.4 0 -0.2 0.6 Z=27.6 4 6.6 5 1.2 1.4 IC 0 3.6 0 1.2