Consider the following linear program, which maximizes profit for two products: regular (R) and super (S):

MAX 5R + 75S

s.t.

1.2 R + 1.6 S 600 assembly (hours)

0.8 R + 0.5 S 300 paint (hours)

0.16 R + 0.4 S 100 inspection (hours)

R, S >= 0

See the sensitivity report provided below:

q2_HW2.jpg

Regarding the resource "assembling (hours)" _________ .

Please choose the option that best fit the empty space above.

Group of answer choices

If the company has more hours of this process they will be willing to pay less for this resource.

If the company has only 500 hours of this process they will be willing to pay less for this resource.

If the company has more hours of this process they will be willing to pay nothing (zero) for this resource.

If the company has only 150 hours of this process they will be willing to pay nothing (zero) for this resource.

None of the above

0.16 R+ 0.4 S s 100 inspection (hours) RS >= 0 See the sensitivity report provided below: Variable Cells Name Value Cell $C$28 Regular - R $C$29 Super - S Final Reduced Objective Allowable Allowable Cost Coefficient Increase Decrease 0 -25 5 25 1E+30 250 0 75 1E+30 62.5 Constraints Cell Name $F$6 assembly (hours) $F$7 paint (hours) $F$8 inspection (hours) Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 400 0 600 1E+30 200 125 0 300 1E+30 175 100 187.5 100 50 100 Regarding the resource "assembling (hours)" Please choose the option that best fit the empty space above