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

Consider the following linear program, which maximizes profit for two products: regular (R) and super (S):
MAX5R+7S\text{MAX }5R +7SMAX5R+7S
Subject to:
1.2R+1.6S600(assemblyhours)1.2R +1.6S \leq 600\quad \text{(assembly hours)}1.2R+1.6S600(assemblyhours)0.8R+0.5S300(painthours)0.8R +0.5S \leq 300\quad \text{(paint hours)}0.8R+0.5S300(painthours)0.16R+0.4S100(inspectionhours)0.16R +0.4S \leq 100\quad \text{(inspection hours)}0.16R+0.4S100(inspectionhours)R,S0R, S \geq 0R,S0
See the sensitivity report provided below:
Variable Cells:
CellNameFinal ValueReduced CostObjective CoefficientAllowable IncreaseAllowable Decrease$SC28$Regular-R00.2551E+301E+30$SC29$Super-S25007.51E+3062.5
Constraints:
CellNameFinal ValueShadow PriceConstraint R.H. SideAllowable IncreaseAllowable Decrease$SF56$Assembly (hours)40006001E+30200$SF57$Paint (hours)30003001E+30375$SF58$Inspection (hours)100187.510050100
Question:
The "assembly (hours)" process is _____

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!