|
Question 1131906: A bed manufacturer makes two types of bed: standard and luxury. The cost of manufacturing each type of bed is 2300$ for a standard model and 3700$ for a luxury model.
It costs 300$ to ship each standard model and 400$ to ship each luxury model. The maximum weekly costs are 851,000$ for manufacturing and 120,000$ for shipping. No more than 300 beds can be manufactured per week. How many bed of each type should be made to maximize profit if the profit is 6000$ on each standard and 8000$ on each luxury?
Answer by ikleyn(52781) (Show Source):
You can put this solution on YOUR website! .
Let X = # of standard beds;
Y = # of luxury beds.
The objective (profit) function is F(X,Y) = 6X + 8Y, in thousand dollars.
The constraints are
2.3X + 3.7Y <= 851 (1) (maximum weekly cost, in thousand dollars)
0.3X + 0.4Y <= 120 (2) (maximum weekly shipping, in thousand dollars)
X + Y <= 300 (3)
X >= 0, Y >= 0. (4) (non-negativity)
The problem is to maximize the objective function under the given restrictions.
The feasible domain is shown in the Figure below.
It is a quadrilateral in QI under the red, green and blue lines - factually, under the red and blue lines.
Plot 2.3X + 3.7Y = 851 (red), 0.3X + 0.4Y = 120 (green) and X + Y <= 300 (blue)
The maximum (the solution to the problem) is achieved in one of the three corner points:
P1 = (0,230) (red line Y-intercept)
P2 = (185,115) (red line and blue line intersection point)
P3 = (300,0) (blue line X-intercept)
Now, calculate the value of the objective function at each of this three corner points
at P1: F(0,230) = 6*0 + 8*230 = 1840 thousand dollars;
at P2: F(185,115) = 6*185 + 8*115 = 2030 thousand dollars; and
at P3: F(300,0) = 6*300 + 8*0 = 1800 thousand dollars.
The maximum is achieved at P2, and this point gives the solution.
ANSWER. The maximum profit is achieved when 185 standard beds and 115 luxury beds are produced per week.
The maximum profit then is 2030 thousand dollars per week.
Solved.
-------------------
To see other similar problems solved by the Linear Programming method, look into the lesson
- Solving minimax problems by the Linear Programming method
in this site.
Also, look into the solutions on other similar problems in the archive to this forum under the links
https://www.algebra.com/algebra/homework/Graphs/Graphs.faq.question.1131906.html
https://www.algebra.com/algebra/homework/coordinate/word/Linear_Equations_And_Systems_Word_Problems.faq.question.1131043.html
https://www.algebra.com/algebra/homework/word/finance/Money_Word_Problems.faq.question.1129285.html
https://www.algebra.com/algebra/homework/Finance/Finance.faq.question.1128383.html
https://www.algebra.com/algebra/homework/Linear-equations/Linear-equations.faq.question.1123217.html
https://www.algebra.com/algebra/homework/Finance/Finance.faq.question.1102103.html
|
|
|
| |