Regular & Super
Consider the following linear program, which maximizes profit for two products--regular (R)
and super (S):
MAX 45R + 63S
s.t.
1.12 R + 1.49 S ≤ 700 assembly (hours)
0.65 R + 0.55 S ≤ 288 paint (hours)
.22 R + 0.33 S ≤ 120 inspection (hours)
Solve the problem:
1. Provide the feasible region
2. Provide the corner points
3. Provide the optimal value solution
4. Provide the optima point (R,S)
5. is paint-hours a binding constraint?
6. is inspection-hours a binding constraint?