Download - Linear Programming
![Page 1: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/1.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Solving linearprogrammingproblems using thegraphical method
![Page 2: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/13.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # days factory A is operatedy = # days factory B is operated
![Page 14: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/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
![Page 33: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/33.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Nonstandardproblems — completesolution to a longproblem
![Page 34: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/34.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Vegetarian Diet
Vern decides to adopt a vegetarian diet consisting offruits, grains and vegetables. His minimum dailyrequirements are 14 units of protein, 16 units ofcarbohydrates, and 12 units of fiber. Suppose aserving of fruits can supply him with 1 unit ofprotein, 2 units of carbohydrates and 1 unit of fiberwhile a serving of grains provides 3 units of protein,2 units of carbohydrates, and 3 units of fiber. Aserving of vegetables provides 4 units of protein, 3units of carbohydrates and 2 units of fiber. If fruitcosts 30¢ per serving, grains cost 60¢ per servingand vegetables cost 70¢ per serving, how manyservings of each type of food should he eat per dayin order to satisfy his daily food requirements atminimum cost?
![Page 35: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/35.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # servings fruity = # servings grainz = # servings veggies
![Page 36: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/36.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # servings fruity = # servings grainz = # servings veggiesConstraints:x + 3y + 4z ! 14 (protein)2x + 2y + 3z ! 16 (carbos)x + 3y + 2z ! 12 (fiber)x ! 0, y ! 0, z ! 0
![Page 37: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/37.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x = # servings fruity = # servings grainz = # servings veggiesConstraints:x + 3y + 4z ! 14 (protein)2x + 2y + 3z ! 16 (carbos)x + 3y + 2z ! 12 (fiber)x ! 0, y ! 0, z ! 0minimize C = 30x + 60y + 70z
![Page 38: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/38.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x + 3y + 4z ! 14 (protein)2x + 2y + 3z ! 16 (carbos)x + 3y + 2z ! 12 (fiber)x ! 0, y ! 0, z ! 0minimize C = 30x + 60y + 70z
-x - 3y - 4z " -14-2x - 2y - 3z " -16-x - 3y - 2z " -12maximize D = -30x - 60y - 70z
![Page 39: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/39.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
-x - 3y - 4z " -14-2x - 2y - 3z " -16-x - 3y - 2z " -12maximize D = -30x - 60y - 70z
-x - 3y - 4z + u = -14-2x - 2y - 3z + v = -16-x - 3y - 2z + w = -1230x + 60y + 70z + D = 0
![Page 40: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/40.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
-x - 3y - 4z + u = -14-2x - 2y - 3z + v = -16-x - 3y - 2z + w = -1230x + 60y + 70z + D = 0
!
"
#######
$
%
&&&&&&&
-1 -3 -4 1 0 0 0 -14
-2 -2 -3 0 1 0 0 -16
-1 -3 -2 0 0 1 0 -12
30 60 70 0 0 0 1 0
![Page 41: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/41.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
Legal choices for 1st pivot element
x y z u v w D
!
"
#######
$
%
&&&&&&&
-1 -3 -4 1 0 0 0 -14
-2 -2 -3 0 1 0 0 -16
-1 -3 -2 0 0 1 0 -12
30 60 70 0 0 0 1 0
![Page 42: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/42.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
We’ll use this one
x y z u v w D
!
"
#######
$
%
&&&&&&&
-1 -3 -4 1 0 0 0 -14
-2 -2 -3 0 1 0 0 -16
-1 -3 -2 0 0 1 0 -12
30 60 70 0 0 0 1 0
![Page 43: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/43.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
!
"
########
$
%
&&&&&&&&
-1 -3 -4 1 0 0 0 -14
1 132
0-12
0 0 8
-1 -3 -2 0 0 1 0 -12
30 60 70 0 0 0 1 0
x y z u v w D
![Page 44: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/44.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
2-52
32
x y z u v w D
Next pivot element?
!
"
###########
$
%
&&&&&&&&&&&
0 -2 1-1
0 0 -6
1 1 0-12
0 0 8
0 -2-12
0-12
1 0 -4
0 30 25 0 15 0 1 -240
![Page 45: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/45.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
2-5
2
x y z u v w D
Possible pivot element?
!
"
###########
$
%
&&&&&&&&&&&
0 -2 1-12
0 0 -6
1 13
0-12
0 0 8
0 -2-12
0-12
1 0 -4
0 30 25 0 15 0 1 -240
![Page 46: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/46.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
2-1
2
22
x y z u v w D
We’ll use this one.
!
"
###########
$
%
&&&&&&&&&&&
0 -2-52
1 0 0 -6
1 13
0-1
0 0 8
0 -2-1
0-12
1 0 -4
0 30 25 0 15 0 1 -240
![Page 47: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/47.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
!
"
#######
$
%
&&&&&&&
0 0 -2 1 0 -1 0 -2
1 3 2 0 0 -1 0 12
0 4 1 0 1 -2 0 8
0 -30 10 0 0 30 1 -360
Here’s where we are after the nextcomplete step. The 5th column has beenput into unit form. We’re at x=12, y=0,z=0, but the -2 in the far right columntells us that we are not yet in the solutionregion.
![Page 48: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/48.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
!
"
#######
$
%
&&&&&&&
0 0 -2 1 0 -1 0 -2
1 3 2 0 0 -1 0 12
0 4 1 0 1 -2 0 8
0 -30 10 0 0 30 1 -360
Choose next pivot element.We’ll use the -1 in column 6.
![Page 49: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/49.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
!
"
#######
$
%
&&&&&&&
0 0 2 -1 0 1 0 2
1 3 4 -1 0 0 0 14
0 4 5 -2 1 0 0 12
0 -30 -50 30 0 0 1 -420
When column 6 is put into unit form, this isthe tableau. We’re at the point x=14, y=0,z=0. There are no negative number abovethe -420 in the last column, and this tells usthat we finally are in the solution region.
![Page 50: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/50.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
!
"
#######
$
%
&&&&&&&
0 0 2 -1 0 1 0 2
1 3 4 -1 0 0 0 14
0 4 5 -2 1 0 0 12
0 -30 -50 30 0 0 1 -420
The problem now becomes like a standardproblem. We choose our next pivot elementby taking the pivot column to be the one withthe most negative number in the bottom row(excluding the bottom right number -420).
![Page 51: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/51.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
!
"
##########
$
%
&&&&&&&&&&
0 0 1-12
012
0 1
1 3 0 1 0 -2 0 10
0 4 012
1-52
0 7
0 -30 0 5 0 25 1 -370
After this step, x=10, y=0, z=1. We’rein the solution region, but we’re not atthe optimal solution.
![Page 52: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/52.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D
!
"
##########
$
%
&&&&&&&&&&
0 0 1-12
012
0 1
1 3 0 1 0 -2 0 10
0 4 012
1-52
0 7
0 -30 0 5 0 25 1 -370
Here’s our next pivot element.
![Page 53: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/53.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D!
"
#############
$
%
&&&&&&&&&&&&&
0 0 1-12
012
0 1
1 0 058
-34
-18
0194
0 1 018
14
-58
074
0 0 0354
152
254
1-6352
Finished! z=1, x=4.75, y=1.75, D=-317.5
![Page 54: Linear Programming](https://reader034.vdocument.in/reader034/viewer/2022042702/55cf9a14550346d033a05ca0/html5/thumbnails/54.jpg)
COPYRIGHT © 2006 by LAVON B. PAGE
x y z u v w D!
"
#############
$
%
&&&&&&&&&&&&&
0 0 1-12
012
0 1
1 0 058
-34
-18
0194
0 1 018
14
-58
074
0 0 0354
152
254
1-6352
Finished! z=1, x=4.75, y=1.75, D=-317.5Minimum cost is C = $3.175 obtained byeating 4.75 servings of fruit, 1.75 servings ofgrains, and 1 serving of vegetables.