Linear programming review
18
*
-
Upload
pkeenan33 -
Category
Technology
-
view
114 -
download
0
Transcript of Linear programming review
![Page 1: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/1.jpg)
*
![Page 2: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/2.jpg)
![Page 3: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/3.jpg)
![Page 4: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/4.jpg)
![Page 5: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/5.jpg)
![Page 6: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/6.jpg)
![Page 7: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/7.jpg)
![Page 8: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/8.jpg)
![Page 9: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/9.jpg)
![Page 10: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/10.jpg)
![Page 11: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/11.jpg)
![Page 12: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/12.jpg)
![Page 13: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/13.jpg)
![Page 14: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/14.jpg)
![Page 15: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/15.jpg)
Solve each inequality for y and graph them to
show your feasible region.
y ≤ 400 – 2x
y ≤ 250 - .75x
x ≥ 0
y≥ 0
![Page 16: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/16.jpg)
Identify the vertices (corners) of your feasible
region.
(333, 0)
(0, 250)
(0, 0)
(120, 160)
![Page 17: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/17.jpg)
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
![Page 18: Linear programming review](https://reader034.fdocuments.us/reader034/viewer/2022052413/5598c06b1a28abd4208b47ae/html5/thumbnails/18.jpg)
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