‘rutorial 1 : Formulation of Linear Programming Problem ‘Learning outcomes; © Understanding the process of formulating a given problem in linear form, This requires defining the decision variables of the problem, establishing inter-rlationsh , establishing inter-relations ip between them and formulating the objective function and constraints 1. What is Linear Programming Answer! Linear pwogueswwving 0 wofewatital echvigue used to tin the best solution fo 0 problem with Linen Helatnhips ) Constroivits and on objective to wonimige bh avivi ze 2. Define the following terminology in LPP: 8) Object function b) Constraints ©) Decision variables Answer : yhjective Fyaction’s Objective Fonction & oO Mathemoti tal exguession wegresenting th gel to be optimized Cmosrmiged 04 wiviwiged) wnstiiaivis’s Conetvaivts ake Ligan inequalities (or) equations Yrotk —Yostriet the possible volves fon the decisin voriables ‘Course Tile | Mathematieal Programming ‘Academie Year: 2023-24 (Course Code | 22MT2008 Page |6 |; : i c) Decision Vowgblest These ovo the Unknown Quy = ae \ be deteruntnth Lmppedg tO be AUCmiNe ty, (ov) vovinbles tho needs 4 vty tho ohjectlve Foe[ster —— ——TStudenr Name 3, What are the steps involved in Formulation of LPP Answer: Steps Fler in Fouvadation of LPs: ’) Listing ovt Decision variables 32) Detouviviy the Diyective fonction Ww) VeFiving tho Condtnortla Between the vativabloy [anelubes Nox vaseline Coahynivts) ‘y) Fotvnlation of LBD ae defived MannerStudent ‘Student Name 4. A hotel has requested a manufacturer to produce pants and jackets forth ‘ts for their boys. For materials, the manufacturer has 750 m* of cotton textile and 1,000 m? of silk. r silk. Every pair of pants (I unit) needs 2 m* of silk and 1 m? of cotton. Every jacket needs 1.5 of of cotton and 1m of sik. The price ofthe pants i fixed at $50 and the jacket, $40. What she number of pants and jackets thatthe manufacturer must give tothe hotel so that these items aay maximum sale? Formulate the problem using mathematical modeling of LPP and define 7 objective function? Solution: Seepsls Ls be tha vonber of poits to produca ys be the nomen th jackte to gradi, Step” Objarkive Fonelion: Not Z = 50% +L 0y Dont: dotton Covattinivd ex bby £50 SOL Consteaded Aut ly 4lv00 Wor -nagptivitg Conatinae J) Neto ZO y2d [Course Title | Mathematical Programming. ‘Academic Year | 2023-24} [Course Code [2212008 Page lS JSteals ox Z= Soerhdy Sypjec’ A patsy 2450 dy ty £\pod wha FES, y=dSradent 1D. Experiment ‘Student Name ] Date 5, A transport company has two types of trucks, Type A and Type B, Type A has refrigerated capacity of 20 m’ and a non-refigerated capacity of 40 m while Type B has paces capacity of 30 mand non-refrigerated capacity of 30 m’. A grocer needs o hire oe the transport of 3,000 m? of refigerated stock and 4000 m’ of non-efrigerated stock The cost per kilometer of a Type A is $30 and S40 for Type B. How many trucks ofeach a should the grocer rent to achieve the minimum total cost? Formulate the problem using mathematical modeling of LPP and define the objective function? Srey loys Nowof toels of Type A ‘hy’ Nlovof ‘ouch of Type B Sep =A: Objective Function : fork ie of Type h tom be. hind with ao bat of 4 30 | Km: foch fowtk of Type B ow fives) with ota of Suclkm re itad cake Wwosmd vith ditto of the troks is equ 4 Hox $= S04) thot ‘Course Title | Mathematical Programming ‘Academic Vear 2023-28 ‘Course Code | 22MT2004 Page |9Sg 2) gets et a “gf yo a. foficgnabate Capon ty 4 dow? age bs 4 Rojaigeradory, Cagarlty af svt Tho % Jalgaon Spinel: doy Vor, 2300 §) Now- fohacgguntnns yataniat fox a non Reteiigesttaryy topority ot Joutk ot ‘Type \ ct Low Aut Bt ‘Aye ® pt BOW fox 0 wan-Rabengaustorys tap otity LOH, tD04y 2 LOCO onatien Fovwilalion of Li \ Oberle t Wing = Bok 4 HOD bobjed f° Hoty A WI, = 300d DO, BOLD = LOH yw ZS Nor -ragatwey Cowtok -Tapa — Shade 15 eee ee See Nee — 6. Advantages of Linear Programming. Linas Progeny uo. wath technique fo optineigation St eh ivan eynhiona to qaninige OY) Miniwtlze on O bjeckiye hdvoulages {) OpHwigabion, Maktwatitel Taricn, Eloniil ts 1 Effioenty Royowco MRoeati on , Jorsion boppat, Cost Lovirgs , SeaiFiehy, Baalyus 1. Applications of Linear Programming Answer: Cowon {pytieatloys oY Linas Pt i) foyounro hhecaklan 4) Dusductior Vawrivy ‘) Scroy Coyle A Aagdics ad) “Tasteprntsdion 10) Téseovuuieay 4) Yorkin Dptws vahior Wakes. Davigy 5) Hawke pubgek Qlerot in, Evan Hava 3) bei fede Posi Ge fodss 9, ot8 A company owns two flour mills viz. A and B, which have differen pro capacities for high, medium and low quality our. The company has entered ates as entered a contract to supply lou to a firm every month with at leas 8, 12 and 24 quintals of high, me and low quality respectively. I costs the company Rs.2000 and Rs 1500 pera er day to run mill A and B respectively. On a day, Mill A produces 6, 2 and 4 quina 2 uinals of high, 4 and 12 quintals of high, medium and tow quality flour respectively. How many days per month should each mill be medium and low quality flour, Mill B produces 2, operated in order to meet the contract order most economically. Formulate the LPP solution Shepet Decision Vostiobl Ky be the wnbor of doy HVILK is cponaed / par Howth y 1 be tho. wowber ot doy MUR ts oitid per Hovsh « Hep: Dbjgetive Foufion Total en Of opovadiay NUL MUD tiv Z = dvok + \500y Sep-3: Gyratveivls: 1: Pasduction Rortuntidi: Hig GusKity Flours de qdy 2% Mato Baal, Flot © Our iy2lh Gheial etnias [Raden War m0 —] course Code [22MT2008 [Page [IRtoo Buntidy Fhose: Lat By = AG Bache LPR Nin Z = sooo ++ YWOoy Subject to brrdy 2% daany 218 La Wy 23u Whe %20 74 2d—_— Tapeninent Dole : a —, 9, An advertising company plans its advertising strategy in three different media. i Fi \edia- television, radio and magazines. Following data have been obtained from market surv. c . et survey: Cost of an advertising unit Rs, 30,000) Rs, 20,000 | Rs. 15,000 6,00,000 | 7,50,000 No.of potential customers reached | 2,00,000 per urit ss reached | 150,000 | 4,00,000 ‘No. of female euston | per unit The company wants to spend no more than Rs, 4,50,000 on advertising. Following are th ents that must be met peo these of requi 4) At least | million exposures take place among female customers b) Advertising on magazines be limited to Rs. 1,50,000, c) The number of advertising units on television and radio should each be between § and 10. Formulate the LPP. “Seg Decision Vostioublas wi be ho wawbx of odwwodiclny units on Havin Ys be the wurden of Audi 84 mits on sadly, Yo nuwben of odwiticirg units in as fe Z, be Nopgive \ oy She tha Number OF adwasdiehy uns Ty Nagasito & cal Programming [As F220 a aSteps: bjedhive Fuwrhon: ov Hag. z= Ayonoent + 6A 7 150/22 + it Brey: Cova 1) Budgh ta Sp, ono 1+ 40,0005 4 IPD 2, + 10102, KLiy 1 ,50,000°K+ 1; OB yb APL 2 + Ho,0102, >I | 2) Hogasiro ubgel foytuniv = [Byovozy f A owaod 7 @) Nanri (ag Hel, Main Sa sAvew, FAH EW & \,50,000 wii ey FL 20iy) LER Fouistion: Now 2 = 400 2008 + $00), 080y + 15 0/0002, 4 Ipopovz, & b,So jon [gomo rks USHD 4 + Tyo 2) + 590 2) D Io ppe0 4.0 0004 > S/R y + 150021 4 VO/Podz, \Gpod Zt [Wos7, 4 1/50/00 HLV4L0 , SZYzN0 M4127 21 2D D Now agplive Covalent ub - (For Evaluator’s use only) comment of the Evaluator Gf Evaluators Observation ‘Any) irks Secured: Out of Full Name of the Evaluator: Signature of the Evaluator Date of Evaluation: ‘Tutorial 2: Graphical Method and Simplex Method ‘Course Title — | Mathematical Programming ‘Academie Year | 2023-24 | iz 22MT2004 we [14nderstanding the process of solving a given LPP using graphs will be discusse 5 nderstanding the limitations of graphical method an ee algorithm. Mt hence introduce the Simplex 1. Which type of L.P.P. can be solved using graphical method? answer: ‘Tho CGogusteristie, ou! 1) Two Decision Variables 3) Linton Diective Fonetton 9) Too Diwerslowl Conhraivts 1) Yowded Feasible Region 5) Now ~ negative Longritvls: 2, Which type of LP. canbe solved using Simplex method? answers Tho Chooaclentsies ove \) Liveon 2d) Yecision Vortables 5) Equality, Constradnts {) Feasle Stoning Point 5) Boonded Feasible Region: t) Now Negative Conciorsivts - 3. What do you mean by feasible region, feasible solution and optimal solution? Mathematical Programming 22MT2008 Academic Vear 2005-24 | Page [IsThe 4eanrble Rego oho Koo oy, the fusible get gs Arana dswon pis tle sd of ad pouble tombivatioe Of vols for tho dorieion oti Bo fred Saltsty adh at yo pray, gpystro 3 * jae Sar A {eon Ration“ O Npece aeh of valves fone dorision Vorioblo, tha calistion alt Pa tomteants pf He Livers pagrasnntyg Paka: Ar is qr within Wo Feasible Rosier 3) Qyfinah Aaudiae Tho Optiwal folutlon a tho heat powdble taluew ssikn He fenible 4g Yeahow 103 detested Yo objertive Fone ton - by, Course Title | Mathematical Programming ‘Academie Vear : 3023-24 ‘Course Code | 22MT2004 Page [16ry makes to tems of P and Q by Wing two devices X and ¥, Processing i 4. An Indust requires SOhrs for item P on device X and 30hrs requires on device Y. py rocessing time requires 24h for item Q on device X and 33hrs requires on device Y. ay ent week, 30 pieces of A and 90 pieces of B are available. Prog ente le. Processin; Starting of the eto 1 time that is vail andon device Y is predict 10 be 3Shr, nd for P inthe current week is predict to be 75 pieces and for @ is le on device X is predict to be 40hrs i Predict 10 be 95 ces, hiustry poliey is to maximize the combined sum of the pice 5 of P and the 3 of Qin stock at he end ofthe week, Formulate the problem of deciding leciding how much ofeach item fo make in the current week as a linear program. Solve thi S linear program graphically using python. Solution: ls Derichon Veorialiler pts be the wusvalon ot lem D ty id gi te the wamba Of The 8 to prcdusg. Sep) Objerkie Fonttion: Now 2 = ggg: Costes * i) Poaranivg Tiwe Caysteoldt om Devin A: Sov taky 440 ) Paoensiny Two Caystanlvh on Devi SORA By £35 ‘Mathematical Programming | Aca 22MT2005A ; 9) hua of i. tole {se = &) rd ae: ais yu P) Won vagatliity Come }) Now: wy =p‘Student 1D ‘Student Name 5 _ avatghtib -pyflot ox ple syngaedrYorRRG_ OF HP = Mpelivgpora (0, tov , 400) gy = (uo -5O#) |B Wp > (y5-Bo*u) ]33 yy = Yr, intern (» (»)») Yy> NP cmietvnars (40/°5~ ay) ob) = 4 ple Figo Lfgsige= [8 (i) pr ports 4 ‘lob = Hot ahuy 4 40") ple plot (47 Yr lobd ~ "Sou. + Shy 215’) pls plat ls Sa » lobed = 439’) sliplotlyy $y Aobel = 'y £40’) ‘Course Title | Mathematical Programming ‘Course Code | 22MT2004pleRi between (1D, Gly whew = [yl al tela = “gray! , alpha =O) | S&S Pu: ALL Between tn, by yd, whos = (ya Zyl) 8 (yess Cla Pgpieay! f allpho :0'5) | Pt fil fewer (4,0, ys rohesa = Ly “e3!) 2 (424 4 talon > ‘goey!, otgha=n's) Me FUL between (4, 0, yb prwhew = (yh agi) 2D (yy 2 fi y 3 tilom=' gan ollpfa duh — seg dud yimiwed und rest = -vosulh Auch toy guia (“Optimal Yond rvabias”) pein (yt e", gt-dust) poi (© 9h =" y5 dual) uk [S43 = " y3 -Avad) ? Dail [S Nivdnad 7 waviwely Aue east) ‘Course Title | Mathematical Programming ‘Reademie Vear 2023-24 ‘Course Code | 22MT2004 Page [34Student 1D, ‘Student Name oes sya Dust Yeovil yl = Od ye 200 (ForEvaluator’s use only) ‘Comment of the Evaluator (if Evaluators Observation ‘Any) Marks Secured: Out of Full Name of the Evaluator: Signature of the Evaluator Date of Evaluation: ‘Tutorial 4 :Transportation problem ‘+ Understanding the problem of transporting/shipping the commodities from the industry to the destinations with the least possible cost while satisfying the supply and d femand limits, |, List out different types of transportation method, ‘Course Tile | Mathematical Programming ‘Aeademic Vear 2023-28 ‘Course Code | 22MT2004 Page [35‘Student [D_ = ‘Student Name ) aaeme: Newest Cavan Method) east Cas Heth, opis bepterisdion MD 7 Stepping Shoe Natl padi ied ‘pisteabution Welbod , Thovuqudadn en Nate deep Tone Praga, Nehoostk Blow Papontive, Heuptiote Nathods | Meta feuniti « Ngovicthany js Transportation problem using NW method aon, Neath Wat Conon Nee cunblow« st 0P Ho preblom , 1) Snitz sectibe, , 2) fopead Moeskon , u) fobautste Tole to 5) Optimality: 43, Transportation problem using Row Minimum method ansner: SCS ae eee 6) Tota tout dyfvitiali gation 3) Mlscabton 6) Oplivaity ty) Sterne 1S uch to vetue Topsy Luminous lamps have thre factories - FF, and F; with production capacity 3,50 and 320 units per week respectively. These units are tobe shipped to four warehouses W:, Wa, Ws, and We with requirement of 20, 40, 30, and 10 units per week respectively. The transportation costs (in Rs.) per unit between factories and warehouses are given below, Factory Warehouse ‘Supply wi Wi Ws We Course Tile | Mathematical Programming ‘Academic Vear = 2023-28] ‘Course Code | 22MT2004 Page [36 JStudent 1D Stent Name T 2 5 30 [ Course Tile | Mathematical Programming (Gourse Code 2272004‘Student 1D iment # ‘Student Name ate ae ha dnd OSB bts | fap et pF | ee] ly |e | % 1 [abs] at if js pels Yeward| Lo] uo 3 ((Course Tite [ Mathematical Programming — (Course Code | 22MT2008ju feast. Souther As! ue 80k | Si a yee haa hag hau =p Too Nasa Among Shor Cork is’. [ego 4 Beit BRI F AH t SAO t VN 2 Nd aad)5, The Ushodaya departmental store has three plants located capacity 80, 60 and 70 kilo grams of rice. Each day the f Ri, Re, Roy & Re with at least 40, 60, 50, and 60 gallons throughout a ifm must fumis Tespectively, Sale With Production its four reat shops {in Rs.) are given below. The "ansportation costs ‘Siare | Retail Shop 1 3 2 3 40 Solve Transportation problem using Row Minimum method in Linear Py a rogramming using python, To ta oe naa fo Hp pulp saduss- \ yngottt pulp supply, = Leo, 0, as) demand > [0,60 150, bo) puswow = pol: LpPrdetam E ‘Twangortation Yucblen’, ply. Ukiviwign) num —howneos = len (soppy) mow datinabians = {oun (osnavd) alocabion ~ [Lprp-Lyovisble/ f(y) yo: 7 lowBoow ©, tak" Tibgen) for ‘\ \W tong [rom-Aastinabtons}} ‘Course Title | Mathematical Programming | Academie Vear 033-24 ‘Course Code | 22MT2004 Page [39Siudenti ‘Student Name Jos As Soing [n01 _sodtess) gystem + = pup. [pSom[eot wah }03] # sMenakinty Fo Vin ange (no sour) buf in Howe (wor ~dagtivghtere Cot wae = 1 Ls Sy />\, [ae s/s yah, Tab, 4,95 5 Jon Fin Anne Crow Sound) pucolmt = polos lpdow (ellacadion {ys fn j 4 Ravage (ow ~boshivaioas)) soppy Cif Jon | Ln dowge (nom —daxttorehio): guaklamt = pulp « [pSow (etscab ton My Ch fen tm Ln denge (nom-soties,\)s derma) Mathematical Programming [A 2MT2008 afos yi Kenge (row ovens): hatin an oe ii | yaw “atten ow. s witlropply ti bag gulost.9 = albodion § 4G] oy qaidaw sole) wiv (oti jgluton.”) fo A tx Moran hom _syshee) for | 1 tonugp (vow -doyfivon) pris [Bn GABA [atlaatinGie ads [Twid bose 2", pof p audn Cprabien dateHyderabad, and Chennai. KL University 6 KL material in printed form at these locations with capacities 1,30 and 20 mana units at provides University branches located at Vijayawada, L Universi wads, Hyderabad, and Chennai respectively. The university distbutes he course sb alto students located at tree locations Bangalore, Hyderabad and Coinbaten The material to dof the students is 5, 20 and 40 units for Bangalore, Hydcnad and Coimtarre ema especively. The cost of transportation per unit varies between different supply points ang pation points. The transportation costs are given in the table, destination ment of KL University would like to determine minimum transportation cost | “The manage! Supply ' BGR HYD CON | 15 60 35 is | 8 30 @ 0 ae 90 20 20 as fe 3 20 0 ‘Transportation problem using Column Minimum method in Linear Programming using Solve Transpor python Ss wang Python: impact mompy as np | def earns tli (en vito dna | HUM COOKED, Mtr dorttvabion = ost Welait sie ahhiallan = ng. ZoKds [Crom seuss , tin Ab vl) eat 4 (Course Title | Mathematical Programming demic Year 2003-2 ‘Course Code | 22MT2004. PageEL a Student 1. is ‘Student Name pate —_— While np Sorm {sibuabion) © wp.sore (dawad) : fallow rains = rpereia(Oortardtrin alleedion, aves ES) gnrrceabiowyrtados = ® “aby nleclinen pint wa) one “tart 9 Ader = nQasyyrin{tostewadrits, witealowt weil -allscabton(: wine nda) wot -cblocadion = min (soppy Ded tegt “Has inder) | do wax Civ tats -ivelas) Abscobion yaniv Cait 20 aban val ial = wer dbpcab ran, 5u0 yy Lawn Bast ans —ivdat) at mans dllscasiny board (aa Asan -\ndat} = wox -blreahioy 7 urn allocation Ca ea ag — a Soa ae Peres |justo bop, vp es (08 90,88) dues = np.cves 15,20, 40h) tag mahi, ~ pp cass ( t fis, to 9), [15 30,604, P30, qo, ao} 3 1) ] alloration. = cally whew awclinh lsh. ai SRP dd wood ["optiwal lasting") i yd {cbkscation) j ‘ 1 Teta eas = np. com [emt _avebain. # oeabiay) Pd Toad Gose:* fated tod)| —___ ae Faperiment# “Tstudent Name Dale Student Name 4 7. The distribution manager of a company needs to minimize global temsport oma between set of three factories (supply points) SI, S2, and $3, and a set of four distributors (demand points) D1, D2, D3, and Dd. The following table shows the transportation cot fo to very demand point, the supply ofthe product he supply points, product at the demand points 1m each supply point and the demand of the F/D Di | D2 | v3 | pa Supply sl 19 | 30 | 50 | qo = s2 70 | 30 | 40 | 60 3 83 40 | 8 | 70 | 20 ia Demand | 5 | 8 | 7 | a4 se Solve Transportation problem using Column Minimum method in Linear Programming Solution: | 2 “ps “Pu _fiels) ttt ro oe to a] q gy juo} &) 4 ao 1b Ts [ Academic Vear: 2023-34 [Page 43 Course Tile ‘Course Code ‘Mathematical Programming 22MT2004se So) = 3 wo| ao] 4 iiicanatcctiataiee A‘Student 1D ‘Student Name re able Achidhon ig rhe r Nyurd The N\ivwam A9ouspotdabion ast + WT * WKLA WAT + ORL ERED HIDE 244 Nowber of Alseablors = wand Geyteg Hento, Pre Aabadion ig feasible . (ForEvaluator’susconty ) Comment of the Evaluator (if Evaluators Observation Any) Marks Secured: Full Name of the Evaluator: Signature of the Evaluator Date of Evaluation: [Course Tite [Mathematical Programming ‘Academis Year: 2023-24 ‘Course Code | 22MT2004 Page |ue Sade _ Student Namie : 7 = \Jertanding to do the process of solving branch and bound method Understanding todo the process of Gomory's cutting plane ene 1, What is branch and bound technique? ansner: Byoweh xd Bard is an cigs hic lebipe fos Laing, opflmigalion ples fiery sieps ow. Joris avh Booed 4) Beordi ergo owd Pore 6) Qnetoalny 24) Pooweling 8) Gewrinatton: 2, Which strategy can be used fo solve branch and bound problem? Amwer? The Statakegien Os! 1) Ganwaing 6 eke ee 4) eunisties and aa | 8) Prana Shavakegy Metoheanistics- t) Nee SlarKion Shvoteny 5) Pasicblsdigahton an Nexus Movagarent - 6) dnivlization avh — Tonmivalion ites os 3) Hoaptive Cte ens 3.Discrete Optimization using Cutting Plane method Solve the integer programming problem Course Title | Mathematical Programming [Course Code | 2272008 ‘Academic Vear 2023-24 Page [4a ee es a oe Student Name = aximize: Z = 3x1 +22 4328 M ‘Subject to Nox z i by | : Lx t2x2tx3 4 “¥ 1 nan AND AW #0. png 3x3 51 Ne FAG 15, FY, OHS S}f0.$) i Ar -V5ug 4: 5 yi 3x2 +213 53 6 34Sp-¥ rear ree) Where x1,42,x8 2 Oand integer. Get the optimal solutig 8 an integer valu ie using Gomory’ wry's cutting plane method. solution Coase Tae | Math ae athematial Programming Soure Coue_[ 22M T2004 a [Aedenie Yarra ane | TT eticles ele ee a —r | _ q am | 0 = : 3 by a fa, {Xs | % SS Me et Teed oa ae = ' oS Sens | 053) Bee ces Pet yoyo] ea | 53 . 5 a seu 3 a] +l | [wal ele a1 § ba 4 mes [ew ed |e ic Xp ay Me Na [>t S53. ‘ (3 ty 38 ce 9 28 OH Ce | OBE Ob OH cS gm3 | 1 | O|® ot 58 Ng apes) ojo | -db4 by a iG, | {is o|b1s |e 54 ie ws oe A a, | - esl iain etal amee Sur a ° el | Cae pe | Cy By [Xe Ma [hs |S, 45, |5y 5 | y | w{ 3 le Tet eye te | ; | w | 4 fb] '] > B&B} 5) Of ots x f PhS] | core ete ES ee Foil Leprs* ol ol qt oF 1 +5 | (ett t hl gqoo| ol el od 8| 35 | ‘ ae | Psin| - 1 = = ts ee 3 | wm | 3 S. \ £37 | 8 | aie bas 1/87 + | 0) $4 | oas} nfo fot} oot (| 845) 9 D Gy | -0'34] ned Sy D-0:9 9) “095 1 ec a] of 5]3 WS 0 Les of of og Be foSio| 7 coe ‘Course Tite [Course Tite aaa ProjRiver MY 4-G20 Wes, Yer, wrk Oot SPlinaom Adlon » Mys8, Weed phgh Satine. \idtwo : Nox J 24h‘a Maximize: Z = 3x1 + 5x2 subject to: pel + 4x2 $25 x1s8 2x2 <10 i,x2 2 Oare integers Use the Branch and Bound technique using Python solution Ryton Papen def Li naont -P: ~Presfomning —b tbraeh 008 bood(s,h,6 bovds, id | NOM Vong = lenle) | Beat sy tution = fone bept -obj -vahse | = Hat (An : de . Salve -lp fe, Ayb jhovdat : | low | P= PUP -Lpfeabiaw [" brnveh tnd ooh LP" patting) v af : < He | yt tet UY a) £19) tbnonds eet pude ‘\pSow (efif Bevis fort inom IM WOR (Mum vars))) | slhon \ tn awe (lox W): \pee poly Sow (afb) ay li pow (how -vexs)) <26t4 | Up selve UY eto tp De TL Naot bn for j nd del brave ova cbrotd (0/8, 5, beowd, i % worQacd bat —Sdabton ba oj vue Lp, sealer = soWe lp [cy 5, ho if [p-stoduss = 4 qotvnn if abt [int (sauaton il == Sakon fo a \f obj a Nddus> bey =0b\vabu~ beet _cotdion = Colabiow best by doe a oj vd aa haswee = bwawehtwdin = raat (li fox i i a ea, ink (odubtow (iL) ( =selationD iJ) if boowh clvhow ts wet New’ Lower boowds > bound sopy() Upper boords = boowds opyt) {owen boobs [Branch - td) = lbs reo ander”) fb, b{sgibtow [Beareh | ras) VPPLr bounds [bowel - vel = et Csolukinya True ‘ndan]) +h, ae on. bane -aws Boowd (c,h ib, bo, | ° Rekoan best oluifou, best bj -volu- Course Tite | Mathematical Programming Rendon Ye 25-28 ‘Course Code | 22MT2004 Pagel5) -_ guanes 10285 0b) | be {15 0119) toons > [ls Abe) , (0Nox),} yw tds, = (0.1) Squiiow , toy -aplus = Goan -psnpnvising ind Coy Ryd buords ab " : : gait (bogie Salubion sles) pia [opti Ahiedive nha", al Oydpet > Optirmows Lolukior WEB BNAe2 QpSivuin Note Now No 2 = 3hs.Explain Gomory’s method for sok 7 Wving an IPP and hence solvi Seeder Ces and hence solving the following. Subject to: | Bxt42< 4x1 + 4x2 59 ash Where x1, x2 > 0 an integer. Solution: Jrdbvindues —platke Vaniobles' Non 2 > dy) +bhy +05, 4 05). Gubjet to: Be rips) B= 5 Gwe tUy, +5224 . pal DoT) feet | te 6 | Cp By Xp Wy (hy 54 5, [Roba 1, 0s ‘Academic Vear 2025-25 Page [50‘Mathematical Programming 22MT2008Maximize: Z = x1 4x2 Subject to: 4xl—a2<10 ax 4x1 -3x2 < 10 ore Where x1,x2 = 01,23. Use the Branch and Bound technique using pyth sowion 15 the funchion, Th fapuls hyd be e= (if \- pave [4 ith , [2.51 , t.a}) b iS [10,10 , 104 boows J Co ors) 1 [orl twh - indies = 0b) 0 Solukion , obj -valuo = Livan — pleading teach aul find (ForEvaluator’s use only) C0, Ky b, bourds int “wieu) Fall Name of the Evaluator: Signature of the Evaluator Date of Evaluation: Course Tile Maihsnatcal Pogmming | Arsdemis ears 2023-28 [Course Code [ 226T2008 Page lsPec Stodent 5 D ge Stade Na uorial8 Quadratic Optimization using Wolfe's Method jgssnine outcomes + Understanding conic duality and finding the duality of giv ‘Understanding Lagrange incon nn” Sve rem ‘Understanding the process of Wolfe's methods 1, Oalin the ses involve in Wol’s mead epee hark Whaler thitelive Fouetion a veinigain, od we ME wit chav to Wel) woiiigadioe Step d's Cowart ke dvaqpalitin y vile squationy by adding Ane Voss ables Sep re Obtatu KET Consors by uaing eaguongeons Cowtoninds - Begs hyby Too pla Sowgln Hathod - Skep:5: Dbtoln the Optiwebity Conbitton (tt 520) Spb: Oise opto Yeusion’ awh Optio \Yoblve- (Course Tite | Mathematical Programming ‘Academic Vear : 2023-24 Course Code | 22MT2004 Page|NA¥ing bloak “hia icone finda ate NZ yy 40 Ya, zo ywWeo “hh 47 2D tla, yh A My NE ZN, 14 3h) = (yurds ~ty- SN wy) 1 oy [yy rtagtt) IN [emesd) mylar) = ay (4 By vy) x wb coat >) aM (3) +3) 2 20 =) yoday Ar THy be SO : yeaa -wPO BL 2 2) —Bayrb-DAr tay “hes © Dw Ty EADStudent 1D. om ee Ste Nan pa 2. Use Wolfe's method for solving quadratic equation MaxZ = 4x, + 6x, — 2x? - 2xyx2 — xP Subject to: x, + 2x, <2 and x,,x) >0 Bit @ ey wt tg HHO det (a¢=51) dL » gees OM iO Bhyoue Hal UyrysO, My, dd bwietal Yostables wi Np Egva beeowe: Gay ta A Ay : Ay tay FAL BY Nya wean, +See: Avatos —Liwplor Tables | fio jo | AWs2D _ {Souse "ite [Mathematical Programming, ‘Academic Vear 2003-24 ‘Course Code | 22MT2004 Page |Nn ts“ a ie ~g kl {a to fot - Sti te ‘ tl Hf | By [Fo |¥ | ae ‘Ib sca alan 4h ot \o ‘Wg | oT Ib the ‘ls, ‘h in) =| 0 a \ iat 7 o — i { | ei © 0 d/ 6 o Ol vt | 01.0 pd} we] sep 0 [8 4 rr allt tS Srey Ptchalel 1 te (i wh HG 2° 5 et al ~ ets) a Optivaye Adloes yaya by OM “awh t ve shee g a) qrind the LaGrangean function for the given problem: inmize ~%1 subject t0°% $4 = 122 4+45=0,.x€K soit ec % we arty el Ayr ks- fo Hoe tontamits deal twclue Inequalities a novos fo tultenbuta slack x) yung vortwobls Coeagt You, the Habla fs Winimiges -*y Subjad 0 AL hell ‘ae PEK She Signifia KTS 0 Leben w the feosible Region: Se Tiere Ropmning [alone Var HE] | “Seode“[22MT2004 Page |EE Student 1D ‘Student Name ] : ik yar Ay be lag svgie Null plow. gre 1 eqoogion Fonction fy pfs 0)= hy saleate) + Ar [hay) For Evaluator’s use only) | Comment of the Evaluator Gf Any) ‘Marks Secured: Out of Full Name of the Evaluator: Signature of the Evaluator Date of Evaluation: a ‘Reademis Veur 2025-24 Page [7Student 1D > gE Student Name | 9 quadratic Optimization using Beale’s Method lr pe Kuhn tucker conditions , un ing the process of Beale's methods pete stes involve in Beal's method poel's Cawwd the Franpol ities ‘ilo equa iy sain Moc Vartiable,, Which Powe, O togt of yim te pbjerdve Fouckion - yo’ eos hry of tha) Given aia 04 oxic \osboBle.- tanists of dyeraiion Sf te Probl ig ‘pushy, 4 osiobly Sky" E+ pNO fro Foxe vantiobs. 1 foun of ron basic Vasile» eye Gubetitale the db telah evprasion of tee bute veoiable. in tee cbjectve Farehon ‘Reademic Year 2025-24 Page 72 SST Matematica rogramming “secede “[rancr2008gue Fouektow whieh baie vosinbls Upsay,, > Keys Yiffowstiaiy the coie® is tabaitcay Uateoetht A Wilh ygetd fo the oti baie vasiobb Sfep-bs Fwd tte fore vaviable Jor whe detivally vik Novish + Slept: Pagan eS gyy)5 fox He Othe Shatin, Sky} + Ooo the optim fdution ow — the Optom he————— je Bele’s method for solving quadratic equation Max z= ax Z = 4x, + 6x, — 2xt — xx, — 2x3 Subject to: x44 2x, <2 and Xm 20 1X2 2 Wyss 45) 28 e spol SRSA 5) pos FOU) = Ye Onse) abu, al 2at sy ~ A (a> OWS) RL = a4 Sivoplayying we ge D buy BG TIONS +45) bet at . -tetiets) 3) eet ow pe 5 ue Ub OSV i) > (ahha) 4 cL 4106S, =D ON IAW = 10 be vials) Hy 219g PN 8 1] = “eee Code T22MT2004 are* shor! 1 “4 * am uh abl “ty 1) at - “uy [t- (43) ais, a Kowep hig we gd: ‘ Flv) = ay a ae AS ty of yh. = (yy OM yt ee Sych vt When 4) Ay tain [+4) Pt Gat Mathematical Programming {use Code [22672004 ‘Readme Veor 2023-24 Page [74Optima ‘dbus 22 Wy th, ig hy os : le Dine SD es WA)A SM ice Ai Sig0 th Guz 1d ate Ib oe beSuet oe Student Name foe ae the fist teraton and identify the ern and eavng varie co nize Xp : wipject torx +%4= Lx +x, =0,xEK 7 the — Objative Aoudion iy, Y Niwlwige’s “Wy > t Lubec’ 4p! Ly ake Wy vy 2d vn vin hewndand forum s Commenting i tok + -t .¥ Now B= Lubjet to's 2 WA OW * OF, avy okys We EMS + OW=O \ “adem Year! 2005-24 ial Programming deni {eT | Mathemati % ‘fuse Cade [22M T2004mt Oh FO%, THY Zh Orth % Oy Fd Dw THA, HOH 2D Ney TOA, 4 Oy A My ayy +0 + OW, AY OW aw bh AON ‘Student ID. ‘Student Name WP Ort OW, Vay Z| ow “WG «hs FON foo Ye Fowlion Betoyna’ Mow 2 =x Subj to HL FOAL TOW, eu tS) =4 “Hy ady FW, “Wy th) =o 4\ =-\ =a DW LW A WADE, 45720 DAL - WL Ms tdvy + Sy =O ‘coe Tile | Mathematical Programming exten ‘Academic Year 2023.24 Page |%6ey | vue Piet Jleunton fe The {nasty Vora fs 5 Witkoad — how 6 Gersality he 1 Leola Wwiabl: —& ans the entering vostable For Evaluator's use only) {J Vey $) WO Oysiune “s, a iS ‘Marks Secured Full Name of the Evaluator: Ls | Signature of the Evaluator Date of | [Comment of the Evaluator (if Evaluator" Observation Out of Evaluation: pase i ee {ee Ta | Mathematical Programming [Academie Ven 2005-38 “ne Code [22M T2004 Page [77indent Nance ———— a quadratic Optimization using KKT conditions 0! il an the Lagrangean multipliers i i ‘standing Lagrange function U + Pigerstanding the process of finding the optimal solution by applying KKT conditions underszn yy sane the Lagrangean multipliers sho foaponge —rwullipliea 2 dy dy, dye. ne fe Word taneovyp Mubhiplion ope promi by the Worf Constretich For Solving the Gel pial 5 We foe 10 fiud the porns wha the — gpundied of the Logenusyar vite gosped to fdlh WA ic wor twa) = Whaw J teptoeds the Giurdieud - \ Fwy lad dusdvablon woth tbe vobich TwpGa the — pertied me Ter “Reade Gai Matemateal Progamming ewe Code [22M T2004 Pagel we Vear0035-24 7tt ‘Student 1D wine te procedure for deriving the Lagrangean —_ vous he Wobbes Miest with He etait yom puddlor, {ydudng Hho objertve furation and spvstveinds . 2) Adwodues Lagiiony. Mullion s ARS Lagenryp uation vsitte for eneh equality — taitnestet tyutias’ tha lograngons Lous Ye logrogin = toler vy the dhjalue forisn and tovshetgh a rho togrowy — Mabliptivg - )) afire Auguaited tnafesrgios: the AW whan ? v4 ‘ “dentin with He ae 6) pe fe batted Ror s Find gitlend padi by “ating dost'wouoy of the logponginn ond tatty Hew Se goro emis Yor 3005-24 (SR aenat opanming —[Acadeiey {eeeCose[22MT2008periment Student 1D Date. Student Name 3. Outline the detailed procedure for finding the o problem by applying KKT conditions Akp-\> Todas the Quadiatic Prengpenrasing Pralblou im fl =e toes OX hubyead tos : Mmeb Who > £ 2D Hep > Frvoudste fhe dagiosgine fonshion by lng, layeseiowe Maliphoa: ep; towiten ‘He KET Condittaya fo ak =O Mk =d ~>® wi) 438 h zo 98 Whoo dy Safaa to He Comtralvte fowead ‘wing Logrargian Nutty tea: Ptimal solution of the quadratic programming {GoueTte [Mathematical Program “eademis Year 2055-24 r atl Programing (oe Code [S200 Page [80SDA: hve Ho KUT Carditiowe by, grouting owhor. Shp ~ Oblein the fersible habudton fore dy Ody ay “Hy hoch het 1+ begs all Hho KT fn Hows: Mep-b: Dbian, feosibla Opti vue fulton and the Opti vole -ea oO [ean 83) cay % -§ Aes i&: 2 way 4a Be a. fenyis] =4y FAK HY 433 2% dy 1. Sy dy 33™ < [oageszd= {ya fi = -Saayedg +3 a ape fyb) = Bury Bat d= st henas > 5) vi = 2k A; uy = Pr ge hbd) 9b ik ey f-duayadgp + dp les asia) PSOh ge shacypabeo a a -SNPNYZ 1320 SR gy s 5 t9Ar ow a) hy = ay tao 45h - DS dares +97 ‘a tn a N >. bye PAL hy +0 D3 fauna, [54-4 / £ Henid 5 # ie OPE Cae: 3: ~ dyads KT ED AO dae -DA\ masone te Qpp using KKT conditions sey ese wet geass 3 axtyt3226 xz0,y20220 wy’ Ays0, Ar=0 bgr MA) SA-AI ay yg g BED 25d +p 4 OAs ade “ ee VSoara Satna Ze =D BN4Y +935 -b=0 duty #3g=6 Myre Web Sey toda - 1 j : 8 3 Wy 236 MMi) an st n= ae © of=3 [Cee Ta [Nena onan — [ei = = =| Page [slOption Aslwhion’ ct Opin Wa: Fs aybsag by pax y Babe hs 8 a be 3 tus ay 95 OSee Student aa nt onthe complexity of the method inthe aby i sence of one ‘constraint “yy WET Method the absence Pe towgtnniat fonds to the Gahuchion in He ict Corditins yooee , Binglitying the puablom - 6, Commment on the complexity of the method in the more than tWo constraints Te Coplay Tonys ith wae fan dw tovstroit® , Became 02 the KOT Conditions on ‘in tocassing the Syupbrity ot tung the abla, ge wesandiyg For Evaluator’s use only) Evaluators Observation Marks Secured: Full Name of the Evaluator: Signature of the Evaluator Date of Evaluation: TWorial 11: Ant Colony Optimization Learning Outcomes Understanding different approaches for solvin, ig problems on ant colony optimization * Applying various approach to solve ant colon 'y optimization problems ‘Course Title | Mathematical Programming ‘Academie Vear 3023-24 —] ‘Course Code | 22M 2004 Page (a2,