• Note that only one parameter is allowed to vary at a time
• Add part (f): Using the ranges you found earlier and the 100% rule, make a conclusion as to whether the current optimal solution remains optimal or not, if c1= 3.5 and c2=-1.75. Verify your answer by solving the problem with the new objective coefficients using a software.

Consider the following problem. Maximize Z= C1X1 + C2X2, subject to 2x X2 Sb x1 - x2 = 62 X1 20, X220. Let Xz and x4 denote the slack variables for the respective functional constraints. When C1 = 3, C2 = -2, b1 = 30, and b2 = 10, Coefficient of: Basic Variable Right Side Eq. N X1 X2 X3 X4 (0) 1 Z X2 X1 : 0 0 1 0 1 0 1 1 1 1 -2 -1 40 10 20 0 the simplex method yields the following final simplex tableau. (a) Use graphical analysis to determine the allowable range for c and C2. (b) Use algebraic analysis to derive and verify your answers in part (a). (c) Use graphical analysis to determine the allowable range for by and b2. (d) Use algebraic analysis to derive and verify your answers in part (c) (e) Use a software package based on the simplex method to find these allowable ranges