Question

Styles Problem 15, p. 850 Given this linear programming model, solve the model and then answer the questions t follow Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc. Subject to Machine 5x1 + 4x2 + 3x3 S 160 minutes Labor 4x1 + 10x2 + 4x3 = 288 hours Materials 2x1 + 2x2 + 4x3 200 pounds Product 2 x2 s 16 units x1, x2, x320

Answer 1

*****Please please please LIKE THIS ANSWER, so that I can get a small benefit, Please*****

If 10 hours less of labor time is available, then following is the values:

B C D x1 x3 x2 o 792 4 48 3 Max Z = 4 Subject to 160 <= 232 200 4 À À À À 160 278 200 16

Solver parameters:

Solver Parameters Set objective: $B$3 To: Max Min value of: 0 By Changing Variable Cells: $B$2:$D$2 Add Subject to the Constraints: $B$5 <= $D$5 $B$6 <= $D$6 $B$7 <= $D$7 $B$8 <= $D$8 Change Delete Reset All Load/Save Make Unconstrained variables Non-Negative Select a Solving Method: Simplex LP Options Solving Method Select the GRG Nonlinear engine for Solver Problems that are smooth nonlinear. Select the LP Simplex engine for linear Solver Problems, and select the Evolutionary engine for Solver problems that are non-smooth. Help Solve Close

Formulae:

1 x1 X2 X3 4. 48 2 3 Max Z = 4 Subject to =12*B2+18*C2+15*D2 LOOO =5*B2+4*C2+3*D2 =4*B2+10*C2+4*D2 =2*B2+2*C2+4*D2 =1*C2 160 278 200 <= <= 16

*****Please please please LIKE THIS ANSWER, so that I can get a small benefit, Please*****