Problem 3: (Sensitivity Analysis) The computer output given below is for a maximizing LP Problem with two decision variables and two constraints. Use this output to answer the following questions: (a) How many units of X and Y should be produced based on the computer output results? (b) How much could the profit coefficient (Si) on X increase or decrease without changing the values of X and Y in the optimal solution? Explain. (c) How much the right-hand side of constraint 1 can decrease or increase without changing the basic and non-basic solution sets? Explain. (d) What are the shadow prices for each resource (constraint)? (e) If the right-hand side of constraint 1 were increased by 1 unit, how much would the profit increase? Explain. (f) If the right-hand side of constraint 2 were decreased by 10 units, how much would the profit decrease? Explain. Linear Programming Results x Problem 7-33 Solution x RHS Dual Maximize Constraint 1 Constraint 2 Solution-> 5. 2 2 30 6. 1. 3. 60 120 240 510 0.75 1.75 Ranging x Problem 7-33 Solution Value Reduced Cost 30 0 60 0. Dual Value Slack/Surplus 0.75 0. 1.75 0. Variable X Y Constraint Constraint 1 Constraint 2 2.5 Original Val 5. 6. Original Val 120. 240. Lower Bound Upper Bound 4. 12. 7.5 Lower Bound Upper Bound 240. 120 360 80 OO