
Trenton H. answered 07/19/15
Tutor
1
(1)
Your Tutor for Math and Science
For this linear programming problem,
Let x = number of pounds of Morning Blend (MB).
Let y = number of pounds of South American Blend (SMB).
Now, let's write down our profit equation:
profit = 3x + 2.5y
Now setting up our formulation table,
Mexican beans Colombian beans
MB: 1/3 2/3
SMB: 2/3 1/3
the constraint equations are:
x ≥ 0
y ≥ 0
1/3x + 2/3y ≤ 100 lb.
2/3x + 1/3y ≤ 80 lb.
Now to graph these equations, we solve for y in those equations that have both x and y in them to get:
x ≥ 0
y ≥ 0
y ≥ 0
y ≤ 150 - 1/2x
y ≤ 240 - 2x
x = 0 is the same line as the y-axis.
y = 0 is the same line as the x-axis.
The area of the graph that is bounded by the x-axis, y-axis, and both inequality lines is called the region of feasibility, and the answer to our optimization problem lies on one of the corner points (vertices) of this region.
the four corner points produced by this graph are:
(0,0), (0,150), (120,0), and (60,120).
Now, we just have to see which point of these four produces the biggest value and we have found our answer!
Recall that at the start of this problem we set
x = number of pounds of Morning Blend (MB), and
y = number of pounds of South American Blend (SMB).
So, checking our four points:
(0, 0) means 0 pounds of MB plus 0 pounds of SMB, which means the profit is 0*3 + 0*2.5 = $0
(0, 150) yields 0 pounds of MB plus 150 pounds of SMB, so the profit is 0*3 + 150*2.5 = $375
(120, 0) yields 120 pounds of MB plus 0 pounds of SMB, so the profit is 120*3 + 0*2.5 = $360
(60, 120) yields 60 pounds of MB and 120 pounds of SMB, so the profit is 60*3 + 120*2.5 = $180 + $300 = $480
Therefore, based on the given constraints, the shop should produce 60 pounds of Morning Blend (MB), and 120 pounds of South American Blend (SMB) to maximize profit.