Question

Consider the following linear program, which maximizes daily total 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 invoke Solver to obtain the optimal solution. Use label and formatting to enhance readability of model and Solver reports.

1. Create spreadsheet model

<Paste screenshot of spreadsheet model>

2. Invoke Solver to find optimal solution

<Paste screenshot of Answer Report>

            <Paste screenshot of Sensitivity Report>

3. What is the optimal solution?
4. What is the maximum daily profit?
5. What resources are binding at optimality?

Answer 1

Solution :

for simplicity here we take R =x1 and S = x2

therefore maximum daily profit is 24583.3333

Thank You..!!