Discrete Math B: Chapter 4, Linear Programming: The Simplex Method 1 ea ann he Simplex Method Day 1: Marner katate: (text pgi69-176) In chapter 3, we solved linear programming problems graphically. Since we can only easily graph with two variables (x and y), this approach is not practical for problems where there are more than two variables involved. To solve linear programming problems in three or more variables, we will use something called “The Simplex Method.” Getting Started: Variables: Use my Xa) yo Instead Of X,Y, 2) Maximize 2 =3x, + 2x, +, Problems look like: 4.1 Setup! A Standard Maximum Problem 4.2 Solving! 2x, +x, +x, $150 Subject to 2x, +2x, +8x, £200 | |] 1 2isto be maximized 4.3/4.8 2. All vatiables, X3,X2 Xiu 20 Look Different 2x, +3x, +, $320 3. All constraints are “less than or equal to” (i.e. < with x 20, ‘To Use Simplex Method: SUEEE convert constraints (linear inequalities) into linear equations using SLACK VARIABLES. Slack variables: Example 1: Convert each inequality into an equation by adding a slack S1, So, Sy, Cte. variable, For example: a) 2x, +4.5x, $8 b) 43x, +2.5x, <100 ff x +x,510 then 5x, +512 3| My + 3X2 #2.9% 4 5 2100] +x, +5,=10 [2 5, 20 and “takes up any slack”Discrete Math 8: Chapter 4, Linear Programming: The Simplex Method Example 2: a) Determine the number of slack variables needed b) Name them ©) Use slack variables to convert each constraint into a linear equation Cone per constraint) a) 3 b) S, 5a, 85 9 Heed +X +¥3 4 + 5, =150 \ | 2x, + 2y2 + 8X34+52=200 | [2% + 3%o + X3 + $3= 320 | Maxi +O + 2x, +x, +4, $150 Subject to 2x, +2x, +8x, $200 2x, +3x, +, $320 [with x, 0.x, 20 SUGGEE REWRITE the objective function so all the variables are on the left and the constants are on the right. | WRITE the modified constraints (flom step 1) and the objective function (from step 2) as an simplex tableau.” ‘augmented matrix. This is called the ‘There should be a row for each constraint. ‘The last row is the objective function. EVERY variable used gets a column. constratats —y Ki GE Put variable In alpha order Ss Sz Ss 2] 1 0 6 Of\50 o I O|200 o \ 0}320 o 8 ole.Discrete Math B: Chapter 4, Linear Programming: The Simplex Method Example: Introduce slack variables as necessary, then write the initial simplex tableau for each linear programming problem. . -X3 + Sy = 138 x3) Find 420, x, Vox, ~ Xa —%a FS 0, and x, > 0 such that 10x, -,-, 138 (3X1 tl #1is + S2.= 205 13x, 6x, +7, $205 [y, + %. 7 2X3 + Sa 34S Lay, +x, -2 $345 “Tk, -3%2 -“X%3 + BHO and z= 7x, +3x, +2, is maximized. eres fo) eel 13 & I4 ot i “7 Ex.4) Find x20 and.x, 20 such that 2x, +12x, $20 4x, +x, $50 Hx, + ¥2 tS. 750 8x, +5x; is maximized “8%, -Ska tB =O 2%, +12%24 5, = 20 and Sys i 2 I o O/}20Discrete Math B: Chapter 4, Linear Programming: The Simplex Method 4 Example 5: A businesswoman can travel to city A, city Bor city C. It is 122 miles to city A, 237 miles to city 8, and 307 miles to city C. She can travel up to 3000 miles. Dining and other expenses are $95 in city A, $130 in city 8, and $180 in city C. Her expense account allows her to spend $2000. A trip to city A will generate $800 in sales, while a trip to city B will generate $1300 and a trip to city C will generate $1800. How ma she make to each city to maximize sales? Write the intial simplex tableau. y trips should let x= atrips city A | 122%, #237 Xz BOTX, + $1 > 3000 Yaz # trips iho | GSK, +£130X2 + 1HOKg +52 =2000 ae #Arps cyt — $00 X, -1300 yz “1 BOOXZ TEC a|el[¢ | lps if | bet eg ne pi 122] 237] 30D £3000 | (31 30a eaee leo o 1 ° 2000 4 45. | 130 | leo #2000 |] 49 10 a sols alee 1800 MAX MyBO, W220) Xz 122%, ¢ 237Kg + BOTXs + 30% \ ASK, + 10x. + 18O%y = 2000 \ MAX B= BooK, + 1300Ke + | FOOXSZ ‘ 4.1 Day 1 Homework Pg 175 #1-8, 19-24, 26 CEE Adi aua lc a ek When you are looking at 2 simplex tableau, you may be able to spot basic variables. A basic variable is a variable that only has all zeros except one number in its column in the tableau, oe 3 2 5) 2 i What are the basic variables in this simplex tableau? 0 Ye | Xa e ° &Discrete Math 8: Chapter 4, Linear Programming: The Simplex Method s ‘One basic feasible solution can be found by finding the value of any basic variables and then setting all remaining variables equal to zero. Example 6: Read a solution from the given simplex tableau. ¥ F OS RS) 8) oS 0 2 0 a 2] 0 80 2yerl2 Mure se 12 EW Unfortunately, solutions read off of the initial simplex tableau are seldom optimal. We are going to alter our matrix using some restricted row operations using one of the entries in the tableau as, a pivot. The goal is to make all other elements in the column with the pivat equal to zero. . ° Remember from Ch 2: Cant use this one hert. Pivot # 2. multiply the elements in a row by a nonzero constant ° 3. add a multiple of one row to the elements of a multiple of any other row. 2 IP mutt. by a neg, use pivot Example 7: Pivot once as indicated in each simplex tableau. pd the solution from the result, ee Xi Xp Xa Si Sa % 1 6 4 1 0 056 -5 © | | -3 © 126 a) 2 1 0 1 fi2 2 2 to § © fle - = 2 6 i Cay 1-6 -2 0 0 10 5 3lo (wor) -BR2+RI DRL 3R2+R3WRD ay -@ 3 © -3 © 36 fey oeer oe) pet ere le al see 2c) 2¥22 2 Sizze Xie EBLDiscrete Math 8: Chapter 4, Linear Programming: The Simplex Method 6 De x SF XX Xs, 1 1 1 0 0 0/150 2 ‘ 1 » |1 2 8 0 1 0 0} 200 ee o 2 © 2.3 1.0 0 1 0/320 3 4 00 01/0 a Wore: “IRI ARLORD BREF LRH SRY -2 -l -l-l 0 0 © ~I60 24 leo 2 80, ° 3 8 e © 260 “RV FRE 2RS Oe orice oto 320 | 3 pet oy 0 ino 4a XH 8 SF X ¥2 Xs S$ Se Sa 2 5 4 1 0 0 0/30 3 0 2 eo -5 ©l\yo 5 0 1 0 olis ~ ou o 38 2 © las 2 0 0 1 of10 332 28 © t @ Ito , iE 30 0 0 1/0 CS r—rC—Cse===e= ‘ Werke -5RS FRI RI -2R26SRASR2 3X2= 10 wig

RA as2e29 285 aa oy 443 Day 2 Homework _ pg 175 # 9-12, 13-16 aDiscrete Math 8: Chapter 4, Linear Programming: The Simplex Method 7 Day 3: (text pgi77-190) A Day 1: Learn to set up a linear programming problem with many variables and create a “simplex tableau.” ‘y\ Day 2: Learn to identify basic variables, read feasible solutions from a tableau, and “pivot” to manipulate your data. Today — Learn to identify which variable to use as the pivot so your feasible solution gives the maximum value of the objective function. Simplex Method Maxi ation Problems Step 1: Set up simplex tableau using slack variables (Lesson 4.1, day 1) Step 2: Locate Pivot Value # Look for most negative indicator in last row. For the values in this column, divide the far right column by each value to find a "test ratio.” The value with the smallest non-negative “test ratio” is your pivot Step 3: Pivot to find a new tableau. (Lesson 4.1, day 2] Step 4: Repeat Steps 2 & 3 if necessary Goal: no negative indicators in the bottom row. Repeat steps 2 & 3 until all numbers on the bottom row are positive. ‘Step 5: Read the solution (Lesson 4.1, day 2) poste \asie (asic Example 1: J 4 ab 5 vy, Yo ¥s S Se % 5 Oe mF x Ye Yo) ee Ase] 1 1 110 100 eee oro 7 ° ea > Sexeese| WL 47 9 1 os00 it eo \ ae ale o g wm oO 12 1 | 6000) & R3 smaltest 20 40 -60 0 0 10 | an ps oe , Skip : ster Most negative Work, =R2+IORI> RI 12R24+RZDRD ve -4 4 0-1 ©7500 ag ug eH Oo IFO 400d yo 1 10 te 8 © 1000 -4o -be o © 1 O° Dd & 3 wel o 500 © © 2H 2 1% | OVODiscrete Math B: Chapter 4, Linear Programming: The Simplex Method 8 Wer comple. IRL #R2RE Manimize 2=31, +21 +, sess He subjectto 2x, +x, +x, <150 1 6 6 60 2x, +2x, +8x, $200 2x, +3x, +x, £320 with 20, x, 20,x,>0 ee “ye 4 2 196 2h + X2 + gt S1 = 150 3ei+2e4> ey = oo © 450 2x, 2X, 4 8X3 tS2= 200 ee a Quy + B%a + Xa 4937326 ~ 3x, “2g -¥a FEE O Xi Xa 1S yoo -2R24R3 PRD wo o 2 -tH 2-2 © 07100 eee tee eet So \ 2) 6 40 Rr RE SRY ooo elaoi ee © fuse 5 2 ase elo TM 7a ' @ 8 [8 Ve 2 seo" ss] 0 2 ° 1 ° 1 °o Wo ez etre tie jt Saye ee 2 480 t * * so L532 : 7 Ye ¥3 8 ve Me 0 | 00 Erase oe | 10 ate 28 a [sce] |e 00 8 2% A250 5170 442150 Sox? ¥ar0 Saale4.2 HWK Day 1: pg 186-187 #1, 2, 4, 5,7, 8 Discrete Math B: Chapter 4, Linear Programming: The Simplex Method Example 3: Maximize 2=24x, +36x, subject to 40x, +80x, < 560 6x, +8x, $72 with x,20, %,20 40x, + OX, +8, =Se0 Gy + BX. S2E 7D "24x, - BX. +2=0 Mi Ye Ss Sz E uo [fo] | 0 © |[5uo © ¢ © 1 oes ee “24-36 o © | jo Mo No S$) $2 Ho sO OU eo ¥o % 10 © |Zte eo. ce lle, 10 altua) ©. © 3 to 20 | booo 9 weak =R} + 1oR2 > RO 4p -%0 -1 0 0 ~ 560 wo to 0 18 e720 Soe ee eomaicg| ec1a( a0, 3002 726 QQ) 20K >Re a eee Ho “Te 9 0 2 Oo “Tio e@ 1 6 26 sayy aS -2p2 +211 RB \2u 0 -b BS © ey vie 6 4 © 2 SoXo oe JOX=WO 2B = "OLE eee B-BeO Box, = 240 MARKIMUM= 300 ete S\+°0 Mara S278Discrete Math B: Chapter 4, Linear Programming: The Simplex Method 10 Day 4: PRAVEMiecakereue (Continued) Example 4: Solve using the Simplex Method Kool T-Dogg is ready to hit the road and go on tour. He has a posse consisting of 150 dancers, 90 back-up singers, and 150 different musicians and due to union regulations each performer can only appear once during the tour. A small club tour requires 1 dancer, 1 back-up singer and 2 musicians for each show while a larger arena tour requires 5 dancers, 2 back-up singer and 1 musician each night. Ifa club concert nets T-Dogg $175 a night while an arena show nets him $400 a night, how many of each show should he schedule so that his income is amaximum and whats that maximum income? a) dub arena My Yo 81 Ss $3 Bf _— 2 Spe 6 @ |166 e % Xe \ {sl ae S wli 2 e Le e7te, dancers \ o <1Se° so |g) Oe oo singers \ 2 <4 "Ws to 6 © © If 0 Musicians 2 ‘ 4150 a a 1s 400 MAY =2R1 6R2 782 mIRL 45R39R> Maximize: %= (15x, + 400%. ayer ea 2R4 — - (week next pase) such that: ¥, + Sk. £160 Xr 2x, +90 2x1 + Xe £180 Yy+ Sup +5, 2150 Xi + 1k + $2 = 10 —(Q24r3RIPR! 150 ABRZ FRB PED 95e2 + 3e4 MR Gueme next pase) 2x, + Xa + $3 7 “115X, “HO0X, + BO ¥ - Yo Si Se 32>Se1s0 300 Ewe 150 © 5o club tours 20 arenas Income = 4,150Discrete Math B: Chapter 4, Linear Programming: The Simplex Method Example 5: Solve using the Simplex Method un The Cut-Right Knife Company sells sets of kitchen knives. The Basic Set consists of 2 utility knives and 1 chef's, knife. The Regular Set consists of 2 utility knives and 1 chef's knife and 1 bread knife. The Deluxe Set consists of 3 utllity knives, 1 chef's knife, and 1 bread knife. Their profit is $30 on a Basic Set, $40 on a Regular Set, and $60 on a Deluxe Set, The factory has on hand 800 utility knives, 400 chef's knives, and 200 bread knives. Assuming all sets are sold, how many of set should be sold to maximize the profit. What is the maximum profit? @ © let ¥,= Fhasic sets Yxat® Regular Set ae? %pe® Delure 00 Basic Regular Deluxe ee FOX Xe Xa aril 2 2 3 S¥00 Chet 7: 1 1 tee bead 0 V ' 2200 pork 30 Ho MAK @) Maximize” 30x, +4OX2 + LOKS Such that “ 00 2h + Wa + BX g F800 200 x BX, EKgeHOO Xatk;€200 Ser Xie R20 @ 2414 2xat 3X34 8, = 800 Xy + Xa $y + Sy = 400 Ae bX gt Sy ez 2HO “BOK, ~HOy, “OKT BAO 2x jo ¥3> 200 Xjzl00 25, =200 $2210 B~18000 4.2 HWK, Day 2 pg 186-187 #11, 12, 21, 228, Xo Xs Si S2 Sp @ 2 2 3 1 ° oo Boo tor te t @ © } 400 ° © | 200 -BR3TRIPRI Rat R2RD woRat RAARH =RI +2829 R2 1 fii 6 o 4 jp -4o bo 6 0 0 1 LO tT (work attached ) 200 200 200 12,000] (werk attoralred ) AGRI + RG PRY “* x Xr Xn Xe Ss aeaieece | ot or ot le 6 5B o 16Work pg tO ip pj ll &S -2 RL SRD BRE -3e3 RIT AL 0 7-32 “3 0 6 -3 Oo “bee 2% 3 t © 26 ¥00 zw et 0-8 o wd -2 710 -2 © © © ~30e Sto 6 § 6 9 —45e— 3B e@ -% 5S © © 152 -R3tRI23R2 Ol ee. 1c) ac yt t ot 6 © too leone omerc=n = uetoee ao) ~\ RIF ORSARD “1-8 1 6 © © 7150 6 6 € 5 6 150 voRs +RE Dey to © be bo © © &O oO [2,008 q oo “tl © Se boo -Bo “Hp “bo © 6 o 1 6 “3020 © © © GO \ 1rx,000 QORt tea PY -Ri+2Ra Ra 0. fo yoo F020 0 6 12070 | yg yw eo H200 ~VWs -yo © Oo ' 2) a OF ole 2 oe coo. ot o-t2 t O wo WS RL ree ey oe 18 © 450 2000 © 6 we t 2008 3uz +R2>RD -4 © 44715 0 © “450 4 o -1 oe 5 © wo oo 5S 1S & © 180 G5 pre DRY PRY 235 8 -14%6 41s 0 9 aia ee yoo Se u1s © 3B 52260)Discrete Math B: Chapter 4, Linear Programming: The Simplex Method 2 Day 5: FEN Mntet kare a el (text pg 191-202) New Matrix Term: The transpose of a matrix A is found by exchanging the rows and columns. The transpose of an m xn matrix Ais written A’, is an n.xm matrix 135] p} ‘| Notice the 1% row becomes the 1% column and the 2° row 4-lo 4 6| I 4 becomes the 2” column, - s 6} Example 1: Find the transpose of the given matrix. a 18 5 3 a) [2 1] ») 5602 ~ 2077 3 fis 2] [ jee? i | 5 ojo7 B27 Getting Started: If we are going to minimize an objective function, we have to approach the problem a little differently. A Standard Minimum Form 1. The objective function is to be minimized 2. Allvariables 20 3. All constraints are “greater than or equal to” Wie.) Subject to 2y,+ with y,20,y,20 Notice: We use “w" instead of “2” for the objective function and we use “y” as our variable instead of x. This is just to remind us we are doing a minimization problem, which needs to be approached differently.Discrete Math B: Chapter 4, Linear Programming: The Simplex Method There is a relationship between maximum and minimum problems. Step 1: (For the problem at right) Without considering slack variables, write the constraints and the 2y,+2y2 210 objective function (as is, not with negative coefficients) as an ‘augmented matrix, 13 Minimize w=8y, +16y, +5),29 Subject to cana with y, 209,20 Yo Ye Pana 9 | 10 Objective function —> W 0. ‘Step 2: Find the transpose of the matrix. co. Use this to rewrite as a maximization problem. Maximires The maximization problem is called the “DUAL” Z= Ax, + \OX2 Yr Xap Constants rays Subject tot GG Onjective unction-—» BLO 10 | 0. Xr LX #% Srv 2¥2 Slo Graphically, what's going on (think chapter 3) wit Mize) we 2 O ‘Miningtci Problem * Maximum Problem: Corner Point w = By; + 16ys ‘Corner Point oe © og ga (0.0) Cane Minna em ie (0,4) (9,0) 72 The minimum is 48 when y, = 4 and yDiscrete Math B: Chapter 4, Linear Programming: The Simplex Method 14 So, the solution to the minimization problem Minimum = 48 when y;= 4 and y2= 1 The solution to the dual problem is Maximum = 48 when x,=2 and x: = Simplex Method If you solve the maximization problem using simplex method: Mok SZ —_____ 210 of] 8] Teme wea problem is the same as the 320 1 0716 minimum for the original 9 wooo 1 0. problem, the correct answer to the Ry +R, oR minimization problem. SR, + RR, Do you see the correct solution (4, 1) anywhere in the tableau? HR: + AR, R y+ Ry» Ry ‘AS LONG AS THE COEFFICIENT FOR Z IN THE LAST ROW OF THE MATRIX IS_-'~_ , THE SOLUTION TO THE MINIMIZATION PROBLEM IS GIVEN BY THE COEFFICIENTS OF THE _S\ACK variable S INTHE lost LINE OF THE MATRIX. Example 2: State the dual problem for the linear programming problem. Minimize w=y,+3y, +7); Maviaize 2 2 = “SMF IKe wy + 4 By, +6y, +99, 2-5 Such thal B+ ee Sl Subject to: 5 yy +3y, 49y, 215 wx #3%23 when y,20,y, 20,9, 20 ay, + Wh.4 sfia ate . ty Xp ert ER we ate \ \ 3 \y 3 4|is | |e ? 5 But the solution x; and x, is notDiscrete Math B: Chapter 4, Linear Programming: The Simplex Method 15 Example 3: Use the simplex method to solve. ce Minimize y+) +3y, fi 0G \5 1.0 VAY tY29 i Such that, 2 247 \2\ SH tds Le with 9, 20,y, 20,9, 20 G maamiee 22 axe Pe ® ot Suchther 4, + 5% z2 . 1 Xi ko 2h x 23 ue = with FO) F220 r 2 a alt +5R27 RD Ge atkosbed) @ We Sea 6 Si anel + BRE eT yy Pat Sgel Ya Ss yy + $923 9x, oH FB AODiscrete Math B: Chapter 4, Linear Programming: The Simplex Method | A e an 16 Wore AITACHED) Example 4: One gram of soybean meal provides at least 2.5 units of vitamins and 5 calories. One gram of meat provides at least 4.5 units of vitamins and 3 calories. One gram of grain provides at least 5 units of vitamins and 10 calories. If a gram of soybean meal costs 7 cents, a gram of meat costs 9 cents, and a gram of grain costs 11 cents, what mixture of these three ingredients will provide at least 60 units of vitamins and 66 calories per serving at a minimum cost? What will be the minimum cost? 4 Sa ln BSH + BK: H5)= 107 se meat ) J , 4SX, FBX. +S =F vitwits 25 4S BO : + 10a Sate qoletieg 5 3 10 Zeb Ski + 1O%a 4 SB eost = 07 roq o E in WX, -be%, TE*P xX 1 52 Ss G Maumee we the 2 Sy = 1O%yg Fol vot we oly, OdYs +. NYS ms Suck thot orl Boy, r WSy2 + bys Flo -bb Buy + 342 + 1OKs 206 _ - “p3+2RI921 Shas =° 3R9+ 1ORA RA 7 i 25 5 {om ] 2aR3 RHR PRY 4S 3 | 0.04 | Xi No Si Se Se 4 3 10 lou Veo aG/ atom |: scume. | cl [Be] Mokimize “aa aul Ex boyy tr eboyr Such Hot 3 ASK + 5%y 4107 ae * Yo, SX e10 uy AS hae BY, £104 ana eh SX * Weil a Whew, XX, 20 eso HWK: 4.3 pg 199-200 #1,2,8,9,14 Follow Book Instructions Exactly #16a, 17, 23, 24 Set UP and State the DUAL Problem... Do not actually solve.@ “IRL 4 G O29 RA M-6 1 8 oo 9 2 = 5 3 7 $00 3 areal + SR4 > Ay 47 235 I O° o 44 45-235 0 0 0 BO 2 ee uy 0 0 6 a4 ° vq ile @ -earreiet =a oly ~5 "10 Oo 0-1 0 5 10 2 0 0 oO _ 5 12 2% ? eo oo 2 o-| 9 103 “3RS+ Ra “IS 30 © 0-3 6 say 4S 30 6 10 oo OY [eae eae 98 30 a o 1O - o +87 3323+ SRY PRY WS 330 © = 300 “330 0 7135 ° ° =IR2FURZ PRD “306 © -lo 3 © Oo & oO 00 C08 eo ce 87 1@o 20 wo © Aeapary e+ Sid THe ayo 6b 8 10 727 © “ayo 8 2 0 be Ww BAe 12.849Discrete Math B: Chapter 4, Linear Programming: The Simplex Method wv 4.4 Discrete Math B Non Standard Problems — Mixture of Maximum and M Example 1: Xr Xa t Xe +S, #100 Cons 10x. + 4X + TXg4S2 = 500 Maximize Xe Ya bX; -S3=0 20x, + 40x, + 60x, : ~ 1204, “HO -bOXZ FE=0 For eo x) tx, +3, 5100 oe et oC 10x, +4x, +735 $500 wy ta ¥e Se $, Bay wy $a, +x, 260 Ww =o 0 (ory When 50%, = 50] [10] ww if 4 500 Bioko 20 “Xz 60| _| <+—+—9— bo =110 -40 -bO © © t ~ = To solve a “non standard problem” Pvok using column 3. 1. If "Minimize", convert to “Maximize” by letting w You do not need to solve using the “dual” from 4.3, 2. Add slack variables as needed to convert to simplex tableau Remember: if <#, use+si if2# ,use~st 3. Checkall “basic variables’, if any are negative, locate a pivot. ~identify the negative basic variable coefficient -identify the positive element in that row farthest left, this tells you which column to choose for your pivot variable. calculate the “test ratio” for each row in that column and choose the smallest corresponding coefficient for your pivot. 4. Check all “basic variables’, if any are negative, repeat step 3 If none are negative, move on to step 5. 5. Solve the problem using simplex method. If there are negative #'s in your bottom row, use the most negative column & calculate the test ratio. Use the test ratio to identify the pivot. Pivot once 6. {fall numbers in the bottom row are positive, read the solution from the tableau. If any numbers are negative, repeat step 5. 7. If you changed the minimum to 2 maximum, change it back using w* a ger—t-fe len] ejlax Discrete Math B: Chapter 4, Linear Programming: The Simplex Method Solve: Example 2 Maximize 2=3x, +2x, +2x, subject tox, +x, +2x, $38 2k, +X, +x, 224 with x,20, % 0,x,20 Bx) “2X2 -24g +E HO rr cere DRL + XaAX%g-Sa zt ow Neto ot vi ¥2 Xs Br 5 A\ robo 2 fay ey ofas —3 <2 “2% WWVte ft -1R2+2R1>8) Pivot Ber t2e32RB toh 18 woe ae) rt -|e2 +2R\ 7 wa crcl © 4 0 72 ; 2.6 © % Be 2 1 0 S52 Bea t2RBAPd @ os 6 -Be 7 ~b-u-4 oO 0 2 0 eur cle 3 2B Bre ee7 er er tose oreo ee Berks >Re 3 o> 4 39 Bu o 1 ~l 0-32.92 ore 6 O22Discrete Math B: Chapter 4, Linear Programming: The Simplex Method 19 Solve Example 3: Minimize w=3y,42y, 3 Ze-w DB BE-3Y, 7742 > BY t2y, + BHO suchthae 2173226 yt Bye te 2 2m 23 ayy ra 82> and y,¥, 20 oF Woe ov we Axle Yo Ye ks [Sx fe wien 421 wee ya a(t] elle . wz 10 03 ; Loje! |\e][ ae tee \yre 7s 2te 4 Bry F 22 Wa R242 RI PRL oe yp 32 + DRS AR wy a Mite (So $+ 7 21 [0 HOMEWORK: 4.4 Day 1 209 #1,3,9,15,