11- solving linear programming problems graphically
TRANSCRIPT
![Page 1: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/1.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Solving linearprogrammingproblems using thegraphical method
![Page 2: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/2.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Example - designing a diet
A dietitian wants to design a breakfast menu forcertain hospital patients. The menu is to includetwo items A and B. Suppose that each ounce ofA provides 2 units of vitamin C and 2 units of ironand each ounce of B provides 1 unit of vitamin Cand 2 units of iron. Suppose the cost of A is4¢/ounce and the cost of B is 3¢/ounce. If thebreakfast menu must provide at least 8 units ofvitamin C and 10 units of iron, how many ouncesof each item should be provided in order to meetthe iron and vitamin C requirements for the leastcost? What will this breakfast cost?
![Page 3: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/3.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = #oz. of Ay = #oz. of B
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
Cost = C = 4x+3y
![Page 4: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/4.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
vit. c
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
Cost = C = 4x+3y
x = #oz. of Ay = #oz. of B
![Page 5: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/5.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
iron
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
vit. c
Cost = C = 4x+3y
x = #oz. of Ay = #oz. of B
![Page 6: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/6.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
iron
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
vit. c
Cost = C = 4x+3y
x = #oz. of Ay = #oz. of B
![Page 7: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/7.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
iron
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
Cost = C = 4x+3yThe 3 blue lines are48 = 4x+3y36 = 4x+3y24 = 4x+3y
vit. c
x = #oz. of Ay = #oz. of B
![Page 8: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/8.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
iron
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
Cost = C = 4x+3yThe 3 blue lines are48 = 4x+3y36 = 4x+3y24 = 4x+3y
The cost will be minimized if thestrategy followed is the onecorresponding to this cornerpoint
vit. c
x = #oz. of Ay = #oz. of B
![Page 9: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/9.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
iron
2x + y = 82x + 2y = 10
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
vit. c
x = #oz. of Ay = #oz. of B
![Page 10: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/10.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
vit. c
iron
Solution: x=3, y=2C = 4x + 3y = 18¢
2x + y = 82x + 2y = 10
vit. C: 2x + y ! 8iron: 2x + 2y ! 10 x ! 0, y ! 0
x = #oz. of Ay = #oz. of B
![Page 11: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/11.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
iron
corner pt. C = 4x + 3y (0,8) 24 cents (5,0) 20 cents (3,2) 18 cents
vit. c
x = #oz. of Ay = #oz. of B
![Page 12: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/12.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # days factory A is operatedy = # days factory B is operated
Example - bicycle factories
A small business makes 3-speed and 10-speedbicycles at two different factories. Factory Aproduces 16 3-speed and 20 10-speed bikes inone day while factory B produces 12 3-speedand 20 10-speed bikes daily. It costs$1000/day to operate factory A and $800/dayto operate factory B. An order for 96 3-speedbikes and 140 10-speed bikes has just arrived.How many days should each factory beoperated in order to fill this order at a minimumcost? What is the minimum cost?
![Page 13: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/13.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # days factory A is operatedy = # days factory B is operated
![Page 14: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/14.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 96
x = # days factory A is operatedy = # days factory B is operated
![Page 15: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/15.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0
x = # days factory A is operatedy = # days factory B is operated
![Page 16: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/16.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
x = # days factory A is operatedy = # days factory B is operated
![Page 17: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/17.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
3-speed
x = # days factory A is operatedy = # days factory B is operated
![Page 18: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/18.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
10-speed
x = # days factory A is operatedy = # days factory B is operated
3-speed
![Page 19: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/19.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
10-speed
x = # days factory A is operatedy = # days factory B is operated
3-speed
![Page 20: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/20.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
corner pts C = 1000x + 800y
x = # days factory A is operatedy = # days factory B is operated
10-speed3-speed
![Page 21: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/21.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
3-speed
corner pts C = 1000x + 800y (0,8) $6400
x = # days factory A is operatedy = # days factory B is operated
10-speed
![Page 22: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/22.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
corner pts C = 1000x + 800y (0,8) $6400 (7,0) $7000
3-speed
x = # days factory A is operatedy = # days factory B is operated
10-speed
![Page 23: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/23.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
3-speed constraint: 16x + 12y ! 9610-speed constraint: 20x + 20y ! 140
x ! 0, y ! 0Minimize: C = 1000x + 800y
corner pts C = 1000x + 800y (0,8) $6400 (7,0) $7000 (3,4) $6200
3-speed
x = # days factory A is operatedy = # days factory B is operated
10-speed
![Page 24: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/24.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Michigan Polar Products makes downhill and cross-country skis. A pair of downhill skis requires 2man-hours for cutting, 1 man-hour for shaping and3 man-hours for finishing while a pair of cross-country skis requires 2 man-hours for cutting, 2man-hours for shaping and 1 man-hour forfinishing. Each day the company has available 140man-hours for cutting, 120 man-hours for shapingand 150 man-hours for finishing. How many pairsof each type of ski should the companymanufacture each day in order to maximize profit ifa pair of downhill skis yields a profit of $10 and apair of cross-country skis yields a profit of $8?
Example - ski manufacturing
![Page 25: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/25.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # pairs of downhill skisy = # pairs of cross country skis
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
![Page 26: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/26.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
x = # pairs of downhill skisy = # pairs of cross country skis
![Page 27: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/27.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
shaping
x = # pairs of downhill skisy = # pairs of cross country skis
![Page 28: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/28.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
shaping
finishing
x = # pairs of downhill skisy = # pairs of cross country skis
![Page 29: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/29.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
shaping
finishing
x = # pairs of downhill skisy = # pairs of cross country skis
![Page 30: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/30.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
shaping
finishing
x = # pairs of downhill skisy = # pairs of cross country skis
![Page 31: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/31.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
shaping
finishing
corners P = 10x + 8y
(0,0)(0,60)(20,50)(40,30)(50,0)
$0$480$600$640$500
x = # pairs of downhill skisy = # pairs of cross country skis
![Page 32: 11- Solving Linear Programming Problems Graphically](https://reader031.vdocument.in/reader031/viewer/2022020709/552544e6550346dd6e8b47ac/html5/thumbnails/32.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
cutting: 2x + 2y " 140shaping: x + 2y " 120finishing: 3x + y " 150
x ! 0 , y ! 0
P = 10x + 8y
cutting
finishing
corners P = 10x + 8y
(0,0)(0,60)(20,50)(40,30)(50,0)
$0$480$600$640$500
x = # pairs of downhill skisy = # pairs of cross country skis
Make 40 pairs ofdownhill skis and30 pairs of crosscountry skis for aprofit of $640