The computer output on the next page is for a product mix problem in which there are two products and three resource constraints. Use the output to help you answer the following questions. Assume that you wish to maximize profit in each case.

(a) How many units of product 1 and product 2 should be produced?

(b) How much of each of the three resources is being used? How much slack is there for each constraint? Which of the constraints are binding, and which are nonbinding?

(c) What are the dual prices for each resource?

(d) 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?

(e) What would happen to profit if, with the original output, management decided to produce one more unit of product 2?

Transcribed Image Text:

Linear Programming Results -1미쬐 Problem 734 Solution RHS Dua Maximize Constraint 1 Constraint 2 Constraint 3 Solution> 50 20. 2. 45 87 25 1250 Ranging Problem 734 Solution Variable X1 Value Reduced Cost Original Val Lower Bound Upper Bound Infinity 25 25. 50. 20 40. -Infinity Constraint Constraint 1 Constraint 2 Constraint 3 Dual Value Slack/Surplus Original Val Lower Bound Upper Bound Infinity Infinity 58 45 87. 50 0. 20 75