Student No: Name: 2021-2022 ENM203 LINEAR PROGRAMMING ASSIGNMENT 4 1. Consider the following problem: Max Z = -5x1 + 5x2 + 13x3 subject to x1 + x2 + 3x3 s 20 12x1 + 4x2 + 10x3 s 90 X1, X2, X3 > 0 The optimal table is given as follows: X1 X2 X3 S1 S2 RIS 1 0 0 2 5 0 100 X2 0 -1 1 3 1 0 20 Sz 0 16 0 2 -4 1 10 According to model, use the sensitive analysis procedure for each change. Then, test this solution for feasibility and optimality, a) If the right-hand side (RHS) of constraint 1 replaced by be =40, do we still have a feasible solution? If not, calculate the new solution. b) If ay is changed from [12] to (3) do we still have a feasible/ optimal solution? If not, calculate the new solution. c) Change the coefficient of Xz in the objective function to C3 = 8 d) Change the coefficient of x2 in the objective function to C2 = 6