Table 3.1: Regular & Super Consider the following linear program, which maximizes profit for two products--regular (R) and super (S): MAX 5OR + 755 s.t. 1.2 R+ 1.6 S S 600 assembly (hours) 0.8 R +0.5 S s 300 paint (hours) .16 R +0.45 s 100 inspection (hours) Sensitivity Report: Cell $B$7 $C$7 Final Reduced Value Cost 291.67 0.00 133.33 0.00 Name Regular Super 70 Objective Allowable Allowable Coefficient Increase Decrease 50 20 75 50 43.75 Cell $E$3 $E$4 $E$5 Final Shadow Narne Value Price Assembly (hr/unit) 563.33 0.00 Paint (hr/unit) 300.00 33.33 Inspect (hr/unit) 100.00 145.83 Constraint Allowable Allowable R.H. Side Increase Decrease 600 1E+30 36.67 300 39.29 175 100 12.94 40 17- The unit profit of the Regular product can be increased by ___ without affecting the optimal solution. A-70 B-33.33 C-50 D-20 E-43.75 18- If production downtime has reduced the available Assembly hours by 20 hours (from 600 to 580 hours), then the profit: A-Will be reduced by $ 1,333 B- Will be reduced by $ 666.6 C- will remain the same. D- The shadow price is no longer valid to calculate the profit. E- None of the above. 19- If a change in the market allowed increasing the unit profit of the Super product by $15 (e., from $75 to $90), then the total profit: A- will increase by $ 1999.95 B- will increase by $ 1333.3 C- will increase by $ 4375 D-the problem must be resolved to calculate the profit. E- None of the above. 20-Which constraint is binding from the following: A- Assembly & Paint B- Assembly & Inspect. C- Assembly, Paint & Inspect. D- Paint & Inspect E- None of the above