b. A linear programming software shows that all three constraints are binding. The optimal solution is (enter your responses rounded to two decimal places):

X1=

X2=

X3=

c. How much should Astaire be willing to pay for an extra hour of department A capacity?

Astaire should be willing to add an extra hour of department A capacity if its cost were less than $________(Enter your response rounded to the nearest cent.)

How much for an extra hour of department B capacity?

Astaire should be willing to add an extra hour of department B capacity if its cost were less than $__________(Enter your response rounded to the nearest cent.)

For what range of right-hand values are these shadow prices valid?

For department A capacity, the lower end of the range is _____hours and the upper end of the range is _____hours. (Enter your responses rounded to the nearest whole number.)

For department B capacity, the lower end of the range is ______hours and the upper end of the range is ____hours. (Enter your responses rounded to the nearest whole number.)

Polly Astaire makes fine clothing for big and tall men. A few years ago Astaire entered the sportswear market with the Sunset line of shorts, pants, and shirts. Management wants to make the amount of each product that will maximize profits. Each type of clothing is routed through two departments, A and B. The relevant data for each product are as follows: Department A has 130 hours of capacity, department B has 160 hours of capacity, and 100 yards of material are available. Each shirt contributes $11 to profits and overhead; each pair of shorts, \$12; and each pair of pants, \$25. a. Let X1= number of shirts produced, X2= number of shorts produced, X3= number of pants produced. Specify the objective function and constraints for the problem. Objective function: Maximize Z=11X1+12X2+25X3 Constraints: Polly Astaire makes fine clothing for big and tall men. A few years ago Astaire entered the sportswear market with the Sunset line of shorts, pants, and shirts. Management wants to make the amount of each product that will maximize profits. Each type of clothing is routed through two departments, A and B. The relevant data for each product are as follows: Department A has 130 hours of capacity, department B has 160 hours of capacity, and 100 yards of material are available. Each shirt contributes $11 to profits and overhead; each pair of shorts, \$12; and each pair of pants, \$25. a. Let X1= number of shirts produced, X2= number of shorts produced, X3= number of pants produced. Specify the objective function and constraints for the problem. Objective function: Maximize Z=11X1+12X2+25X3 Constraints