Question: ( DO NOT use Excel! similar problem we discussed in class in details ) . Consider the following linear program, which maximizes profit for two

(DO NOT use Excel! similar problem we discussed in class in details).
Consider the following linear program, which maximizes profit for two products--regular (R) and super (S):
MAX 50R +75S
s.t.
1.2R+1.6S600 assembly (hours)
0.8R+0.5S300 paint (hours)
0.16R+0.4S100 inspection (hours)
Sensitivity Report:
\table[[,,,,,,],[Cell,Name,Final,Reduced,Objective,Allowable,Allowable],[$BS7,Regular =,291.67,0.00,50,70,20],[$CS7,Super =,133.33,0.00,75,50,43.75],[,,,,,,],[,,,,,,],[,,Final,Shadow,Constraint,Allowable,Allowable],[Cell,Name,Value,Price,R.H. Side,Increase,Decrease],[$ES3 Assembly (hr/unit),563.33,4.00,600,1E+30,36.67,],[$ES4Paint (hr/unit),300.00,33.33,300,39.29,175,],[$ES5 Inspect (hr/unit),100.00,145.83,100,12.94,40,]]
Question 10
If the company wanted to increase the available hours for one of their constraints (assembly, painting, or inspection)
!
@
2
3
$
4
Q
(1)
G
F7
 (DO NOT use Excel! similar problem we discussed in class in

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!