Graphical solution of linear programming problem
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 4. 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 using graphical analysis.
https://brainmass.com/statistics/quantative-analysis-of-data/graphical-solution-of-linear-programming-problem-69222
Attachments
Solution Preview
Question 13:
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 4. 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 using graphical analysis.
Let number of necklaces be = n
Let number of bracelets be = b
Since 3 ounces of gold is required for each necklace, 3n ounces of gold is required for n ...
Solution Summary
To find the linear programming problem using graphical method.