linear programming review
TRANSCRIPT
*
Solve each inequality for y and graph them to
show your feasible region.
y ≤ 400 – 2x
y ≤ 250 - .75x
x ≥ 0
y≥ 0
Identify the vertices (corners) of your feasible
region.
(333, 0)
(0, 250)
(0, 0)
(120, 160)
Evaluate your objective function at each
vertex.
P= 2x + 1.5y
(333, 0) : P= 2(333) + 1.5(0) = 666
(0, 250) : P= 2(0) + 1.5(250) = 375
(0, 0) : P= 2(0) + 1.5(0) = 0
(120, 160) : P= 2(120) + 1.5(160) = 480
State your result in context.
To maximize profit she should make 333 cups
and no plates.
Smile! You’re done!!
http://ak.imgag.com/imgag/product/createprint/3172442/3172442d.gif