Cinear Programming Results Problem 734 Solution X X1 RHS Dusi Maximize Constraint 1 Constraint 2 Constraint 3 Solution- 50 1. 3 2 25 20 2 3 1 0 999 45 87 50 1.250 0 0 25 Bag X Variable X1 X2 Constraint Constraint 1 Constraint 2 Constraint 3 Problem 734 Solution Value Reduced cost Originala 25 0 0 5. Dual Value Slack/Surplus Original Val 0 20 45 0 25 0 89 88 Lower Bound 40 --Infinity Lower Bound 25 75 0 Upper Bound Infinity 25 Upper Bound Infinity Infinity 58 12 (a) How much of each of the three resources is being used? How much slack is the for each constraint? Which of the constraints are binding, and which are nonbinding? (b) What are the dual prices for each resource? (c) If you could obtain more of one of the resources, which one should you obtain? How much should you be willing to pay for this? (d) (e) What would happen to profit if, with the original output, management decided to produce one more unit of product 2How many units of product 1 and product 2 should be produced??