You are on page 1of 9
Operetronal Reseach Assgnment-1. Name - Avinach kumar Gupta Reg. No-~ 2oigu0st ‘ Gwoup - CsA2 Q-1 = LP. Model formation: Decision Variable LT for Gift fack A, Xaoc = Mo. of kg of oc nA Xacc = No- of by of cc in A Xaw = No- of Hy of W in A for Gift Pack B, Xboc = No- of ky of dc in B Xbec = No- of ly of ce in B XbwW = No- of by of W in B for GifT Pack ©, Xcoc = No of by of Oc Ine Kece + Nov of Hy of ce in € XcwW = No of ky of W Inc for Gif Pack D ~~ xdoe = No- ‘of Ky of Oc in D xdec = No» of 4 of cc in D xdw = No of ky of W in D Scanned with CamScanner So . "The LP. Model Produ ch'on maximize (tote) Profit) Z 3D 2o{Xaoc + xace +xaw) + Q5o(Xboc + Xbec + Xbw) + 2ro(xcoc +xXCce + XCW) + l200xdoc + Xdee + Xdw) +— go(xaoc + Xboc + Xoo + xdoc )— qoixace + Xbce +XCce + xdec) — Jo(Xaed + Xbw + Xcw + Xdw) SubyeeP to the ConsTrainls Plast Capacity CongfrainTs 3 — Xaoc +xboc + Xcoc + Xdoc =< 200 xacc +Xbee +.xXcce +xdcee < 200 Xaw + Xbw + XcwW + XdwW <= |So specification ConsTeainTs for the GifT Pack A Xaoc >= OY (Xaoc + xacc + Xaw) Xacc = < 0:20 (Xaoc +Xace +Xaw) for the GrfT Pack 8 Xboc >= OY (Xboc + Xbec + Xbw) Xbec < 0-20 (xboc + Xbee + xbw) for the Giff Pack ¢ Xcoe 7 = 0-4 (XCoe +Xcce + Xew) Keee <= O20 (KWCHXece +xXew) — “Scanned with CamScanner \é Max Z = —X, + 2%. ST X,-x%, <-! -OS5% +L, 8 2% L1,%, 70 Replace. all the dreqpollites ConsT rains by equation, X-L, <-l X,-X, = I —@ ze tre —O5L) +%. § 2 ost, +x, = 4 —® he Valu. of obsective funchon aT ExTreme Points + - ExTreme Poinl Value of objective Function Zs —-X%, + 2p C%¥2) -((o) +20) 22 Cor!) -1(0) +20) = Y Cor»? -1(2) +203) = 4 (2-3) Scanned with CamScanner | |." The mMaximiz. Value of z occu af | Tuo CxTreme poinTs « ze Hence Problem hal Infinite No- of ophimal Solution for “ep. with max zZ =y | —— (83 Use Tao - Phase Simpler Method Max 2 = Sx,— YX, + 3X3 ST ax, + %, — 6X%_ = 20 Gt, +Ox%, +10% € 76 8x, 3x, + 6% < So L, -Lp,%y 70 We ConverT LPP into STandard form b Using Slack Variable S$, 8S, and an ark etal Variable A, Max z = 5%, — UX + 3X4 ST, 2X, + X_— 6X3 + A, = 20 6X, + SX, + lot +S = 76 Ox, — 3x, +64, + 6, = So Hy Xa XS, Sa A % O An Initiod Cadhe feasible Sof” Li= i, 2 Xy = 0 Ww 16 ~ on nad Scanned with CamScanner Phase-1 Auxilacily LeP Max 2% = Ox) +02, FOX + OL + 2 — Ar ST-, = 20 2X, +%q — bKa +A 6X1 + Sx, Hoty +51 9x) — 3x. + 6Xg F522 50 MaTwix -form, Ax=B MX, % S, S$, ATL % 20 - o o | oon z 1 -6 x, | 2] 78 6 5 Ib 1 0 Offs, 50 -3 6 o § oS, % Treration 4 Ze Cj Erlering Variable = %) Ak Min o = 6-25 Usovine Basis Variable = Sx key elemenT = 8 Scanned with CamScanner Heration 2 a7 - iS Oo at = 0 <- ° 2-q = (- 1Xo+0+0%1)-0 =0 2-G = (xa, +04+0)—0 7-3, 2-G = (-IXE) +0 +0) ~0 zs L Zy- Gye [Xo +oxI+0x0}-0 = 9 Zs— eg = (“IKEL) + O + 0] -0= y W=-G= [1t9+0) -GD = o | ExTeving Variable = Ty Min toto = Yo | leaving Basis Yoriable= A, | Ky elemenl = 4 Scanned with CamScanner Tteration 3 Oo Oo oO oO oO =~ Cp} B YY % % 5 S, A,|™rtte = -L q 0} ty, se 0 | % oO bo 0 o 26 J 2 29 Si se ° 36 > > O}x,]ss} y o -6§ O Lo & 7 + 1G 1g ZG | 0 0 6 0 Of Max 2” = CgxXg = 0 No arlificial Variable appear fn basis- Sine all 2f-cjzo , an ophmum Solution + the Ehaxiliora LeP hos been oblatned and Maxz*=0- with no artficiel vVariabled in the basis. So, We pr Phoue Ir: Phase IE :- Considered the final Simplex Table of Phase I - Considered the acTual CosT aulociated with the On ginal Variables. Deleted the Ariifictal Variable A: Column from the table as Pt is eliminated in Phose 1. Maxz = Sx;—4X, + 3x, +05, +05, Scanned with CamScanner G 5-4 3 0 QO - 0 =! 0 t i + 2 0 0 284 I & - ! ! O 4 0 4 q 2 0 0 64 o 4G 0 2-4 = E4X0+4 oxo +5x1) -5 Zr-¢,: (“WX $0 40) -E9) Zyatys (“HXHEH) 40 + [B)) -3 = Zy- Cy = (-4x0 + Oxl-+ Sxo) —o= Zs-tg= (-¥% (4) FOXR +4) -0O8 ah Sine all 2j-¢j 0 , An optima) feasible Solution has baen reached: Hence, 4n optimum feasible Solution to the given Lep is , Lys 5S 7 oO uv o ow o pre >, %gr0 + Scanned with CamScanner Max Z = CeXxe 7 SS xs (“4 x39 +SExo +S J u IO 40 + 215 + 3S fas uv a | \ Scanned with CamScanner

You might also like