Question: sensitivity report 1 pts Question 1 Homework problem #3-55 has the following linear programming model formulation: maximize Z - $12X2 + 8x2 + 10x3 +
1 pts Question 1 Homework problem #3-55 has the following linear programming model formulation: maximize Z - $12X2 + 8x2 + 10x3 + 6x4 subject to: flour: 2xy + 9x2 + 1.3x3 + 2.5x4 $ 74 cups sugar: 2x1 + 25x2 + 1x3 + 1x4 24 cups eggs: 2xy + 0x2 + 5x3 + 2X4 36 eggs oven: 45x1 + 35x2 + 50x3 + 16X 480 mins X1, X2, X3, Xd 20 where x; = #cakes, x2 = #breads, x3 = #pies and X4 = #cookies Here's part of the Sensitivity Report: Constraints Final Shadow Constraint Allowable Cell Name Value Price R.H. Side Increase SHS6 Flour Used 74 0.08 74 20.37 SHS7 Sugar Used 21.4 0.00 24 1E+30 SH$8 Eggs Used 36 1.24 36 7.17 SH59 Oven time Used 480 0.21 480 79.32 Allowable Decrease 26.08 2.60 25.67 79.22 What is the maximum amount Tracy should pay for 41 more minutes of oven time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
