Formulate but do not solve the following exercise as a linear programming proble

Question

Formulate but do not solve the following exercise as a linear programming problem. Ace Novelty manufactures Giant Pandas and Saint Bernards. Each Panda requires 1.5 yd^2 of plush, 30 ft^3 of stuffing, and 5 pieces of trim; each Saint Bernard requires 2 yd^2 of plush, 35 ft^3 of stuffing, and 8 pieces of trim. The profit for each Panda is $10 and the profit for each Saint Bernard is $15. If 3600 yd^2 of plush, 66,000 ft^3 of stuffing and 13, 600 pieces of trim are available, how many of each of the stuffed animals should the company manufacture to maximize profit P in dollars? (Let x represent the number of Giant Pandas to be manufactured and y represent the number of Saint Bernards to be manufactured.) Maximize P = _______ subject to the constraints plush _________ stuffing ______ trim _______ x greaterthanorequalto 0 y greaterthanorequalto 0

Explanation / Answer

Maximize

P=10x+15y

Subject to the constraints

1.5x+2y<=3600

30x+35y<=66000

5x+8y<=13600

x>=0

y>=0

So, fill it as above.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---