D.1 7.2-3. Consider the following problem. Maximize Z= 2x + 7x2 3xj. subject to x + 3x2 + 4x3 s 30 x1 + 4x2 - ss 10 and X1 20. 1320, X, 20. By letting xa and xs be the slack variables for the respective con- straints, the simplex method yields the following final set of equations: (0) Z + X: + . + 2xy = 20 (1) X2 + 5x; + x - xs = 20 (2) X; + 4x2 - x; + x3 = 10 Now you are to conduct sensitivity analysis by independently in- vestigating each of the following seven changes in the original model. For each change, use the sensitivity analysis procedure to revise this set of equations in tableau form) and convert it to proper form from Gaussian elimination for identifying and evalu- ating the current basic solution. Then test this solution for feasibil- ity and for optimality. If either test fails, reoptimize to find a new optimal solution. (a) Change the right-hand sides to (b) Change the coefficients of x, to C3 a= (e) Change the coefficients of x; to 421 (d) Introduce a new variable Xs with coefficients C6 do das (e) Change the objective function to Z= x + 3xy - 2x (f) Introduce a new constraint 3x + 2x + 3x, 5 25. (g) Change constraint 2 to x1 + 2xy + 2x, S 35