(闭卷,可用计算器) 1 LINEAR PROGRAMMING PROBLEM is the production manager for the Bilco Corporation, which produces three spare parts for automobiles. The manufacture of each part requires processing on each of two machines, with processing times(in hours) as the following table. Each machine is available 40 hours per month. Each part manufactured will yield a unit profit as the following table. Ed Butler wants to determine the mix of spare parts to produce to maximize total profit. Please to formulate a linear programming model in algebraic form(本题10分) PART Machine 1 0.02 0.03 0.05 Machine 2 0.05 0.02 0.04 Profit 50 s40 2)The next five(5)questions refer to the follow sensitivity report Adjustable Cells Final Reduced objective Allowable Allowable Cell Name Value Coefficient Increase Decrease SB$6 Solution Activity 1 3 SCs6 Solution Activity 2 0 SD$6 Solution Activity 3 0 1E+30 Constraints Final Shadow Constraint Allowable Allowable amme Value price R.H. Side Increase Decrease SES2 A Totals 20 7.78 10 12.5 SES3 B Totals 30 SES4 C Totals 18 1E+30 A. What is the optimal objective function value for this problem? (4s) a. It cannot be determined from the given information. d. $90 b.$7.78 s330 c.$240(闭卷，可用计算器) 1 LINEAR PROGRAMMING PROBLEM 1) Ed Butler is the production manager for the Bilco Corporation, which produces three types of spare parts for automobiles. The manufacture of each part requires processing on each of two machines, with processing times (in hours) as the following table. Each machine is available 40 hours per month. Each part manufactured will yield a unit profit as the following table. Ed Butler wants to determine the mix of spare parts to produce to maximize total profit. Please to formulate a linear programming model in algebraic form. (本题 10 分) PART A B C Machine 1 0.02 0.03 0.05 Machine 2 0.05 0.02 0.04 Profit $50 $40 $30 2) The next five (5) questions refer to the follow sensitivity report: Adjustable Cells _______________________________________________________________________ Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$6 Solution Activity 1 3 0 30 23 17 $C$6 Solution Activity 2 6 0 40 50 10 $D$6 Solution Activity 3 0 -7 20 7 1E + 30 _______________________________________________________________________ Constraints _______________________________________________________________________ Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $E$2 A Totals 20 7.78 20 10 12.5 $E$3 B Totals 30 6 30 50 10 $E$4 C Totals 18 0 40 1E + 30 22 _______________________________________________________________________ A. What is the optimal objective function value for this problem? （4 分） a. It cannot be determined from the given information. d. $90. b. $7.78. e. $330. c. $240