Scribd
Upload
112 views

Math Optimization Problem

Javiera Fernandez solved a math optimization problem to maximize profit by producing dressers and rocking chairs. She summarized the constraints of carpentry hours, staining hours, and maximum products. She then graphed the feasible region and identified its four vertices. By calculating the profit at each vertex, she determined the highest profit is obtained by producing 40 dressers and 100 rocking chairs.

Uploaded by

Javiera F.
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
112 views

Math Optimization Problem

Javiera Fernandez solved a math optimization problem to maximize profit by producing dressers and rocking chairs. She summarized the constraints of carpentry hours, staining hours, and maximum products. She then graphed the feasible region and identified its four vertices. By calculating the profit at each vertex, she determined the highest profit is obtained by producing 40 dressers and 100 rocking chairs.

Uploaded by

Javiera F.
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Math Optimization problem solved by Javiera Fernandez

I find that the best way to start to solve a problem like this is by summarizing the given information Summarizing the information Dresser: 5 hours carpentry, 1 hour staining Chair: 2 hours carpentry, 1 hour staining Carpenter: max 400 hours Dyers: max 140 hours 20 to 40 dressers At least 20 rocking chairs GOAL: max profit 1 dresser: $200 1 chair: $80 Now we are going to find the restraints X= amount of dressers Y= amount of chairs 20 to 40 dressers: 20 x and x 40 At least 20 rocking chairs: 20 y Dresser: 5 hours carpentry and Chair: 2 hours carpentry and Carpenter: max 400 hours: 5x+2y400 Dresser: 1 hour staining and Chair: 1 hour staining and Dyers: max 140 hours: x+y140

Graphing the constraints

20 x x40 5x+2y400

PGOC

x+y140 20y

Now that we have graphed the PGOC we have to find the four vertices (to later on be able to determine which one gives the greatest profit)

Vertex #1: (On the graph we can see that a vertex is created when the yellow (x+y140) and blue (20x) lines meet) Solving for x+y=140 and 20 = x *substitution method* 20+y=140 Y=120 Solving for x when y = 120 x+y=140 X+120=140

X=20 Vertex #1 = (20,140) Vertex #2: (On the graph we can see that a vertex is created when the yellow (x+y140) and purple (x40) lines meet) Solving for x+y=140 and x=40 *substitution method* 40+y=140 Y=100 Solving for x when y = 100 x+y=140 x+100=140 x=40 Vertex #2 = (40,100) Vertex #3: (On the graph we can see that a vertex is created when the blue (20x) and red (20y) lines meet) Y=20 and x=20 Vertex #3= (20,20) Vertex #4: (On the graph we can see that a vertex is created when the purple (x40) and red (20y) lines meet) x= 40 and y=20 Vertex #4= (40,20)

Finding the highest profit As we said before, the goal is to find the maximum profit We know that that will be one of our vertices since the max is always found there We are going to solve for the profit of each vertex and then compare to find the highest one Remember : X= amount of dressers Y= amount of chairs And 1 dresser: $200 or x=$200 1 chair: $80 or y=$80

Solving for profit vertex # 1 (20,140) 20(200) + 140(80) = 15,200 Solving for profit vertex # 2 (40,100) 40(200) + 100(80) = 16,000 Solving for profit vertex # 3 (20,20) 20(200) + 20(80) = 5,600 Solving for profit vertex # 4 (40,20) 40(200) + 20(80) = 9600

Vertex #1: 15,200, vertex # 2: 16,000, vertex # 3: 5,600 and vertex # 4: 9600 Answer: We would obtain the highest profit with vertex #2, building 40 dressers and 100 rocking chairs

You might also like