Question: Aa Q Search Consider the following linear program, which maximizes profit for two products--regular (R) and super (S): d su... MAX Z-50R + 75S s.t.

Aa Q Search Consider the following linear
Aa Q Search Consider the following linear
Aa Q Search Consider the following linear program, which maximizes profit for two products--regular (R) and super (S): d su... MAX Z-50R + 75S 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.4 S s 100 inspection (hours) Sensitivity Report: Cell Name Final Value Reduced Cost Objective Coefficient Allowable Increase Allowable Decrease $B$7 300.21 0.00 50 Regular = Super 70 20 $C$7 150.32 0.00 75 50 43.75 Cell Name Final Value Shadow Price Constraint R.H. Side Allowable Increase Allowable Decrease $E$3 563.33 33.33 600 1E+30 36.67 $E$4 Assembly (hr/ unit) Paint (hr/unit) Inspect (hr/ unit) 300.00 0.00 300 39.29 175 $E$5 100.00 145.83 100 12.94 40 If the company wanted to increase the available hours for one of their constraints (assembly, painting, or inspection) by one hours, which one should not be chosen. Group of answer choices If the company wanted to increase the available hours for one of their constraints (assembly, painting, or inspection) by one hours, which one should not be chosen. Group of answer choices inspection paint assembly none of these three constraints should be chosen

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!