3. (25 points) The computer output for the solution of the following LP problem is given in the second attached le. Min lSXl +15x2 +l6x3 s.t. lxl + 1x3 530 0.5x] - 1x2 +6x3 315 3x1+ 4x2 - 1x3 220 x1,x2,x3 30 (A) (2 points) Which constraints are non-binding? Why? (B) (5 points) What will happen to the optimal value of the objective function if the right hand side of the 3rd constraint is changed to -2? Why? (C) (5 points) What will happen to the optimal values of the variables and objective function if the objective function coefficient of Xlis increased by 0.5? Why? (D) (5 points) What will be the objective function value if the right hand side of the 2nd constraint is decreased by 12? Why? US) (3 points) Give the optimal solution for this problem. (F) (5 points) What will happen to the optimal values of the variables and objective function if the objective function coefficient of the X2 is decreased to 14.5? Why? Objective Function Value = 139 . 730 Variable Value Reduced Costs X1 7.297 0 . 000 X2 0. 000 0 . 676 X3 1. 892 0. 000 Constraint Slack/Surplus Dual Prices 20.811 0. 000 WN H 0. 000 -3 . 405 0. 000 -4.432 OBJECTIVE COEFFICIENT RANGES Variable Lower Limit Current Value Upper Limit X1 1.333 15 .000 15.543 X2 14.324 15 . 000 No Upper Limit X3 13 .500 16 .000 180.000 RIGHT HAND SIDE RANGES Constraint Lower Limit Current Value Upper Limit 9. 189 30 .000 No Upper Limit WNH 3.333 15 .000 111.250 -2 .500 20.000 90 .000