1. A jewelry store makes necklaces and bracelets from gold and platinum. The store has 18 ounces of gold and 20 ounces of platinum. Each necklace requires 3 ounces of gold and 2 ounces of platinum, whereas each bracelet requires 2 ounces of gold and 4 ounces of platinum. The demand for bracelets is no more than four. A necklace earns $300 in profit and a bracelet, $400. The store wants to determine the number of necklaces and bracelets to make in order to maximize profit. a. Formulate a linear programming model for this problem. b. Solve this model by using graphical analysis.
A)Formulate a linear programming model for this problem
Maximize profit=
Subject to:
(gold, oz)
(platinum, oz)
(demand, bracelets)
B) Solving this model using graphical analysis
Point A:
profit=1600
Point B:
profit=2200
Point C:
profit=2400
Point D:
profit=1800
In order to maximize profit, the optimal point is chosen. Point C which yields a profit of 2400 is the optimal point.
Comments
Leave a comment