Consider the following linear program, which maximizes dailytotal profit for two products, regular (R), and super (S):
MAX Z = 50R + 75S
s.t.
1.2R + 1.6 S ≤ 600 assembly(hours)
0.8R + 0.5 S ≤ 300 paint (hours)
.16R + 0.4 S ≤ 100 inspection(hours)
R, S ≥ 0
Implement the LP problem in a spreadsheet model and invokeSolver to obtain the optimal solution. Use label and formatting toenhance readability of model and Solver reports.
- Create spreadsheet model
- Invoke Solver to find optimal solution
          Â
- What is the optimal solution?
- What is the maximum daily profit?
- What resources are binding at optimality?
