Har13526574
Har13526574
19.12.2019 • 
Mathematics

Formulate but do not solve the following exercise as a linear programming problem. kane manufacturing has a division that produces two models of fireplace grates, x units of model a and y units of model b. to produce each model a requires 3 lb of cast iron and 8 min of labor. to produce each model b grate requires 5 lb of cast iron and 3 min of labor. the profit for each model a grate is $2.00, and the profit for each model b grate is $1.50. if 800 lb of cast iron and 1200 min of labor are available for the production of grates per day, how many grates of each model should the division produce per day to maximize kane's profits p in dollars?

maximize p = subject to the constraints
cast iron =
labor =
model a =
y = 0

Solved
Show answers

Ask an AI advisor a question