r MATHEMATICAL PROGRAMMING - | 2052105 DEPARTMENT OF COMPUTERSCIENCE AND ENGINEERING SUBJECT CODE:20CS2105 MATHEMATICAL PROGRAMMING-I problems on concave and convex closure. #10 Date of the Session: //, Time of the Session:_ * Demonstrate the Problems on concave and convex closure ¢ Understanding and solving the problems on concave and convex closure 1. Define Convex Closure .- ce floaty e Of a shape is the Lmallert- comie 2 ie Contain ft ot be defined ofthe, asthe esseolh Of o pices, Werrtex sels aie agen eboset- ie 2, Pleguiial ComiSat’Sne pobits g Prequivalertly as! tpe Zot % a0? OS yt * OF +he plane ine vw, hgh cse 461 a bounded Auber; onler Legusie maty b. > © a8 the re Vesualizey . ‘ea encloed bra ubber helt nok 2. The optimization of a function given by Objective function i,e min x, + xz and subject to x? +x3 < 1 and x} < x, with constraints x,and x, greater than 0. determine whether given function is convex or not. Constrants are ¢ RP pe -140 =O. B= 2, 40 ©. 2X iR_ yO chee fn: aonveaty re Ta cee 4 toe, Sate 54 for, = 28s Scanned with CamScannerFE MATHEMATI . = aa — QO +4 } aay pei Now, “Hessian mati te) s [ie ere, Yt loene, M4 oer tr > [> oF OD oy, taal =(Ro] [2] Se OU at (o,o) Vo Sl-weay (3 4] SY ge elso cr BPR DEY 18 Conver 3.The optimization problem of the form min f(x)subject to gi(x) < 0,i=1,2,....n is called convex programming problem if f and g; are convex functions. each, Conver of © let t ape, ee Vey Ao By te Obove vrube , Bore the frien Consiiacts ate Vertex tuncting tim 2,42, Rabo Conver: Scanned with CamScannerMATHEMATICAL PROGRAMMING ~ 1 2052105 Bigg > fenction given by max 4z, 4 3r, and abject ios, Hop) <4 ee <1 with %1%2 2 O. Optimize the given function is convex or not. Consivorks ate . Rey —440—O RR, -1L0 —®) Cheo Hf 8. ft = EBNG converts of @: ea cones AO et Grate let Yaee, - r PR HU St 24 As _ aa Fey Atationniy e,2! Sit ere ; aie \ 10,220 A= (PY fox? -Py ls» PR, an FP lee, Sloe ate >| «f | ao ns #12 [01 (oe ps-aleL? s\-{2 i } -f ; ox) leo o 4) . AR \ "ol = 10) i i ee \ . ha { VAS ate st 7 H1+0 e funshon. ove z function. B ie stag 24e,t3a, Sine One ete Constrokne tg aw nat toner fanctlon. Comace he esuttart obRat he cunction- 3 € PY leas ae, PY foe ] aan _ ree oO = Scanned with CamScannerMATHEMATICAL PROGRAMMING ~ | 2052105 2, Write a python program on Convex Optimization fropstt pulp ag Pp: LP ~ prob = p-lp Problem (lop lntgiffan win pale! Pb TEP: LP Nadliatsle bw, towRound =o) Minin’ 3 eS Y> pe lpvlortatte Cy, towPound >) Lee probaake rsky- Lp -pwb= ate trusts. Lp- prebt = ety es3 ; tan be any tp BR oe Choe. Lp -pwbde we p24 Lp-prob+>yraa, Up—prv bb ~P Lp —prolo. stove 4) YP Lp Status (Le -Prb. delved s] ~r p. statue Ce) —e Ps Nalue Cy) ~¥ P. Noline LLp— prob-oljeatie) Inport eta py at &D B= Cp. Vasfetle ¢) ‘y= Cp: Waofalgte ©) obfeat fee =cp Midnfige (ee “W)* 2) Conswainks = eankyo >Q, can be choy ‘ lased op the egy] Prebler, Pi Obie 26. protien (olfectire / Contta ity) + Problery . solve () ge. Pred pot ¢ s [vealeons , realeon.s3) (rer: Cl-realeons 1Vealeonsy, (realeens Pe CG poe ga gye ae $ Boe Woy -petint C3 5 ug end », - AWodRiic2= PICS (vealeons rrealcona), » Yealeons 3 Upexs ( {vealeoes vreatonsy | (veal cons, Nealconsy) 3 Prratlet soflage 5 $2 locou0 Ppoinks, distance , Pod», distances * > Pap S distance, poMs, Ure ppeints : = 2fe§ (p,4) TIL ldy othen Petre Nou end , pofrsts o distances? . f+ S numélems 2protints 7 29.2 then : teeny, oP Sppettie “tas List Woals : BB, x paints (ty + 1 Cporaded )-+hem, “threads :- Tayu .- contre $ pared , Tasks > [SubtRP4o . true 35 Cec the fap]. sopemel MaaiinumCloments Girtance pote , y On) (oq.ema foe] - prorated true]? 6 de $ ubdPiPde Lpeints s[ine Cr] PDs SutedRiPde( Potnts Cbds te, Chet Ond 5 t end’, Modute *relyeproct polite «Cant (Cxenleons tealeons)) , Spina, Palle) = >flase? ,¢“) local max 2. men 2, buy | Pes Po Pss Maw Wo LS Tools .,- pid maximal Clement (points, S234 z AVY YC . woth & Sunt tou: Hic rn na Clemest (pts Pt (porated) ten. « ia hull. =(thveads. Task, -StartCresed taske s (Scutd te, (Cpefrits . [mine , max x| t- paralle? Fyre) (_pefnts , (max -e, ming) > patatle severe}, 7 5 else ae end + end*, — ©" Scanned with CamScannerMATHEMATICAL PROGRAMMING — 120¢s2105 2. Write a python program on Convex functions numpy fh an ae opttn fe Empert miifinfze -Sealay D> Meth [let Gb fnpesrt Bae. A MK det objective Ce): am Yetwin Lsotw\H* 9.6 Test = miofmPge — Scalar, Cobferfve ,metiod — brent?) Opt_e, opty ~vesult ('x} 5 rest [fears P¥ut t'o ‘ypat wily, 6) opt_2’). print Ct optimal out flelin Bf % opt-y) Print etal traterations D2 7.4>° ~ vesat Cortes ay) ore, Maw = ~loO59 iB toro pubs = Han: CORR re, 6, 0) ~loogets > Lobfect Pre (eS fey Yo Trpuls } Pyplot. Crotpuks stoopets ry Peplot - plot ( Log). Copt-43, 8), eater ~~) peldt Show 0) Tart, (ForEvaluator’suseonly) Comment of the Evaluator (if . , Any) MarksSecured: FullNameoftheEvaluator: SignatureoftheEvaluatorDateof Evaluation: 36 Scanned with CamScanner