Objective function: max π = 10Cln +30Pol
Subject to: 4Cln + 6Pol ≤ 12 for machine 1
8Cln + 4Pol ≤ 16 for machine 2
Cln ≥ 0
Pol ≥ 0
To maximize the profit we have to decide what amount of each product should be produced.
This problem can be solved using linear programming techniques.
First we will solve these two simple linear inequalities.
After solving these two two linear equations, we will get some point of intersection i.e (2/3,1).
When we plot these two lines on graph we consider the region under which we will maximize the profit.
Considering this reason, we get 4 different points and they arr (2,0), (2/3,1), (0,2), (0,0).
We can simply come to the conclusion after substituting these points in our objective equation i.e 10*cln+30*pol.
We will have maximum profit if shiny company produces 2 polishers and no cleaners from machine 2.
Get Answers For Free
Most questions answered within 1 hours.