We have a linear optimization problem.
We have two plants with different capacity for each type of fertilizer. Each hour, the plant can produce a mix of the products.
Each plant has an associated cost per hour of operation.
Let:
J: the number of operation hours of the Jonesboro plant
M: the number of operation hours of the Macon plant
We can write the total production for the LP fertilizer as:
Each plant produces one ton per hour, and the total production of both plants togheter has to be 100 tons or more.
For the MP fertilizer, we can similarly write:
For the HP fertilizer, we can write:
We have the equations of the restrictions:
The objective function is the cost function, that have to be minimized:
We can graph the restrictions as:
(J is written as x and M as y)
Now we can graph the objective function, and minimize satisfying all the restrictions:
We can see that the minimization happens when the MP and HP restrictions meet (both restrictions are "saturated").
Then, we can write:
The cost is:
The combination that minimize the cost is:
Hours of Jonesboro plant: 32.307 hours
Hours of Macon plant: 49.231 hours.
Total cost: $ 61,845.60