Lesson 24 Solving Linear Preqvomming | Maximiration _Prebien bgetivee: _ \ Soe linear pragromming — mavimirertion’ problem graphical 2s laterpret the weletiong te maxiniaation pribienr. Linear prgramming wed gor obtaining the mart optimal welutio) per problen with gwen conetrarints - tn Nnear progvomuing we pormulete our Ol - fipe problem into ot | mathenatical model. tt involves an objective punction tiear i joequatititg with ——_vubject r constraints. _ Linear Prag ramating A metho of dealing with lecizion —prebiens thar con le _exprecred ag conctroined linear mentrocts. IF wit help managers 42 __deaity _ develop a _jfscherion _vehedtie anc on lovertory pokey tee willl = ottepy rates ememng nthe. : peture ering at the ome time minimine, = He tote 7 production enc! “avemtory orci t_properie op Uneor _ tregraning _Probiens _ - t Mazikiting Crs ox £ by) : - de Miriniring CO aK + by) the _punction yo be. the“ opjective function / or cost _nidiminertion- in The Meually —sepere 48 _-prepit nayimitertion Kegramaiiy —_preelens conctraints oe. given by incauuantities (cated merquatity —_constraiats) . - *enlivo ‘Scanned with CamScanner¥ shee ar typer oF Conetreiinte oer Cons Haat = limit on the dyaitability og aroures = ayo Ceperred oe erplicit constraint Non“ negativity — coartraint 7 constraint that eattricty oll_the _ Vatiabe fo 2eo ond pede elution ~oue yeperret at _inpticht —_corrtraint Solving —_finearn programming | Maximization — prebiem: trampie. A Fin manupactueec 2 predvote O% and S. Each product ie precesed by 2 wachines » M1 onct Ma Each unit oo type & requires | hour oF processing Mend 2 founc in Me one cach unit oor type 8 regres SS mmtrs on cnt \ hour en oz the peefit en precter Kis P20 per mit ancl 9)_prauet os SORE (eM rani per BO heures each month and Mpa SOO bene hed many units OF each, type can be manwpcctited in ve weath in order ts maximize He preps? Ssivtiea Step i Create OF seummerny table Let be the prmaet Ant oy the Mowe _coatingeney table ip neceatony : Product Machine 1 Machine 2 Pregit x - ie 7 — 7» Le Ke i aS od eee aad aye suaiilavitity Roo hours $00 pours *anliuin ‘Scanned with CamScanneroat Shep Bi vere up the _cunetionc Maviwine ? = lox + de. Subiper tei x + Sy < tbo mue tee 9 Machine | de + y £ 300 ours in Machine Z x 20 Sop 3: sere per pantible verticier — algebraicay / graphical wing the equality punches abwe 9-) xt Sy =200 lea = 6, 2 66-6} C°,C667) Ler y= Ox -200 C200,°) Le ty £300 Lere= 0, y =a00 (2/3607 Lex y= o,x= Ise (190) £2000 ond 2K + £ 380 b-) Fem OF _inteweetion of x + 3 ax + Y = 88D tk ty = so 2x Fy F980 = 2% - by = “#00 z “Sy = % tay = 20 2 Cx t2y sao) ae “pe vowe por x: xddy 2200 P+ GC2)rADO -o x = 400 - €O ~~ % = Wo P14, +8) are C0, CC.EF\ CISD, 0 Janet C140, 2) Fite ane peacibie vertices Vtep 4: vubsitate the pearitle vertices te the punction eget the manu Maximire : 2 10K + 50. +0 Co) tg0 C 66.6%) © 2,006.10 20 (150) +38 Cs) = PS, e090. 90 20 Cio) + 806%) 7 PS,400-60 Step 5! pecision meepoe, thee ae xs io Unite er promer & Ot yy! 29 ee Modinun —_propit op PS, 100%. *enlivo ‘Scanned with CamScannerLegsen 22: wfolving Linear _Pragrameiing: Minimivation Problem Cc\eorves. | SeNe _linton _pregrammiing —_niiminization probleme graphically. 2: Interpret the volutions mini mizertion preblere strandawd Minimiration — Problems: (Bective pUnction is minim et 1a Naropes are _ nen - negative: 3. A Constraints are inthe pormiax + by 4... 2 constant Dual Probleme: Every viendard minimiretion Linear pregramming problem 1S ousocioted WH og Steridord mom zertiOd — erethem Cera Vc veto) the original probem is calles the pyinal prclolemn and the: ence Ported protien “Calley he ual prokiem. _ The Rundomentol theorem op Duratiny A panat prebiem hay solutes ip and oh tee ayrracpending dual prakier hoe a rotution. Melving — Lincor Programming: — Minimitetina — Problen Exampl®. Milagre ie planning fe Cechoe Hh operational cach i manag her parn purines te increave her pret iW deiMQ yo, he muck determine how mam fate —_ precaction harvey eqvipment +2 build: ths objective ancl comet raints are patlowe Minieite monthly cary cs POOR + Goy Subject +e x t2y 210 ax tay £ 18 yy D2 a i aie enlivo ‘Scanned with CamScannerate: Wewten! Counp te fais vtep S vince” aut prnctions are Cobjecti¥® explicth ant Waplicit) (step 3! Miniai2 —monthly coc Cr phx + Goy Sober to! wr zy Ds 3x + 2y Lig = Kore x yte a) * + 2y = 10 ter x22 ys CRN) and tek y= 0 xrI0 od) L A Aniy is the point op _intervaction op xt 24 = [0 ancl « 22% a |b) Se tay te ter 2 yee C8) om ee ye, ere C0) Karis Ue the poitt op intewection op Sx F2y =1@ and ye Wo and Fx t 2y HIP C? pint of intersection ey FO ap + ty FO Bx thy oe vrone por teererere | she pewibie vertices we, C26) 62) cre cd. 32 | Utep 4) fubusiture, fhe peasible —verticey to the _punerion i to ger the Rayimuin 4 ee = Secz) 4 cece) = Puce SdCr) + SOCK) = F S90 50 CH + €003) = P 380 | 5 3 & © Step SF: Deering 1 Y= U uit and = Yumity anette Minimim Sock oF Pax0| *enlivo ‘Scanned with CamScanner