bi eo Asthificial Variables Techniques. The Lee tm which conshainls may alko hove = and = sings aptly snsusing thak all au onside fm this section. Jn «uch ‘cages basis matiix cannot be obtained as am idewthy Malic t the Al arding Aimplx able, therncoree we drkodue a noo pe oy Vakiable callect ths oxtipiciol vatiobles, “These Variabus axe ficthous ‘aud cannot = have any physical meaning. To Aolwe |such bees thee arc two methods | ty The f [ti The | | Big- M j | step Qs Step 4+ Expres the poroblem Chonnes Big- M Method Tuo - Phase Simplex Method . Method :- tn fd standartd 402m- Add non-negative aolipicial variables’ to the Jeyt Aide Df wach of the wqualions corotesporcling b consbiainks ef tie Sype = on =, However addition of these aout gicral voruicbles causes violation of the toxvuspondi constotain ts . Theraporie, We would like to get oid of these vooti ables and uot allow them to appear to the final Abtution. This Ls achewed ty asvigning a VOY Aovige punall (-N oe moat mization and M 451 minimization) +” the objective -function, i ;| ; Tae | Step a:- Solve the “todiiid LPP ‘by fino, Ney 1 C0keL om q | unt any one of the dhuc Case. May a, % | ; ; | i appeats tn | ay yy no artifical variable app the ‘ and the optimalili sn0Ranps au faltied, | the uutent 4olulion ts an optimal bay fay, olctron 7 by or at least enc acligicial verwabl S . basis at xew level and dhe pli adily Cendilien’ a -Salisgitd, Shen Ue curung “chet, is an tplimal haste -feasible Solution, “y 4 at Acast cone Ahpeial variable appears the basis at positive devel and the eptimalily conditien salisticd , then the eruginal prsblins” fadsno fiasible elation. Te solution Aalisdies the conshradnte Bat abes st eplimizc Vie ebjcelive pfurclion, ince Gt entain | a vey Levige penally M and it called pseudo optimal Adlution,| Solve the following Lpp by Big. M melbod . | Min Z% = 5%, Sub te constiaints + 6% 8X, 1 5%. = 500 3x, + %2 |S 1200 Ny ZO, Max x = - 5%, - b%2 Sub be conslraiols Qx, 45X02 - Sit AL > O 1500 1200 ——> © ax, +t. — 2 + Ae = x) Xe. 8 So A, Az Xe a S i oO \ o =| 2 \ © -t ° if [L200 Ruowk he objective funetion Max Z 2 - 5% — 6x2 40S +08 - Ma, ~ MPa Gimplex Tab - T B] Ce) Xe | xX] %] Ss x Kagicolumn A y-m ABE 2300 An |-™ 1200 = ja00 T G27 Xj (zy - G) =-SM+eSimplex ‘Table - 7 Hy | lo Bl Ce] Xe] xy, xX, | Sa | ota | ~% -| 2100 Y ~ 2100 © 1 2 B 3S -5 13 ! Tia oO Bi, _ . * ine no Al Value ts nigabive , olution - The ° optimum optimal solution %& 3) 24500 and 3 Le 5H) 4 by oe Amo) (6 a 2100) = 2700@ Solve the — 4ollowing Lp by Big-H Method. Mox Z= x, 4ax0. Sub bo constratuls BX, + 2%. Bb % +642. 23 Hi ks % 0, Sol: 3% + 9%, - 8, 4A =6 —> O % 46%: - S$, 482 =32 —+@® [Rewrile ths objective 4unchion | Max z = x, +A%2 10S, +082 - HAV - HAa Cj values f 2 0 o -x -¥J Simplex table 4 Ce Simplex Tabee :FLimplx Table fn | Limptx: Table -¥ ft a) —_1—_ i | 1S je - > 1 2 60 6 Ay (a - 4) 0 4 0 Ly Sine all the ° | HMimuke tn thy cwlumn & Gre negaline | the poblim has an unboundedUNIT - tL PORTATION PROBLEM Transportation paoblm - Snilal Base Feasible Solution C1prs) usthg Noxth - West Conner Methed - Least Cost Methecl, and Vogel's appsiouimation method - Ophmatily th Trtansposttation p2toblem ~ Stepping Alone method - Modi method - Mazimizalion Fuloduction :- “the * diausportation prwbim is one of | the Aub clases of LPs. tle the objective ts lo | barspoxt various quanhlirs of a single homogenous “tornmedity that “are dnitially atosud ak vacivus oligins & |dippeant deshinations fh. such a, way that the ‘bransnorttalion eat is. minimum, To achicve this, we [must know the amount and Jocaticn 6} available applies and She ‘quanbtur demanded. Je addition, we tout know the costs that suesulk 40m chancnoatinge one unit of commodity — ftom various —ovugin ty various “duabination, lhe Aansportalioun Algeaithen:- | jStup 12> Aormutate the porcblem and ieviauge tie dala t fo the mati foam | “The qoamute tion o the rauspoxtation pacblen ts Atmilas lo dy LP prcbler 4osmutation. Alene Ike objective function & the total kawspoatalion coatbias 1 ose - | aud te OM hx ¢ ny” | . at £06 h SOULE an demand available 4 a | i L baste tastble 40 | Step 21 Obtain 9° ambal 4 Lute, | i Ort usecl Lo . | Thaee diggetot methods si . | ; % 1 | intial Aoluton. | * Noth - west wooinel method x Least wAt method x Vogel's approxi alin” Penalty ) Method, The initial Ap luhion obtained by any Of, the g, methods muse Aalsyy the following condibions. tio “The Aolubion must be fcasible fe 4E must Aah qu the supply and demand eonstrain le [ alse Called — sum conditions | (tty The number positive allocations must be | "qual to min-l, whee m ie, the number. | mows and n & he number of columas. | Any Avlution that aakupy tit’ above cin | | is called on Atgenesali bast feasible solution | othuwise, degenake 52 48 &4 | Via 45 ee =| ' Solution :- No. 0}. works = No. of machine wi The given Cost mabuix us quae matin. Row minimization : Coma mininetjablon- a ° a a = Heri {tceeeeO heme teeeel 2) 1s 2 [Bl 1 4 0 16 i 5 a 3 o 4 = 149 14 : f 4 «1 | No. axmignment: La) = oxen of coat mateix (A) © he Aplubion ty optirourn. The assignment wat = 40 +55 44844) | = 184 “he optimum asrigrnent it wootker | Machine 8 H B Fl ) ¢ \ ‘21 >@ The assignment cost Of assigning ag. Pie operator 4 amy one machine is given fy the table. Sind dhe optimal assignment ty Hungartan ywethod . s Operaloouw. af Y Ti wv A [10 5 18 | B | eee eee 2 | aekint | aa elm 4 3 2 | 6 le nu 4 + | | Solutten :- = Alb. of pperalors No. oF machine is @ BqQuare poate. cost roakeex _ The given | few minimization olumn minimizalicn Ss ° g 0 5 &) 7 i ° 6 20) woe a 3 5 if o A 4 a ot io 6 A 2 a ‘ 2 2 ny = dotdet Of, cont. matein £4) No. o} axsignment C oo The solution 3s plier © Ghe opLraure ansignmunt cost = paar arse she opiimun qitocations © Machin * operator . , 1 B wv cif BS \A8 BE th Ag |g pecsons, The assignment cost ate gée, Dat | 1 i $f $A, a) 4264 | plo as es Al | e/3 2 9 2 6 ’ | a) | tla 5s ea 5 | | Solution | No of A0ws (5) = No of. twlumns (5) +. The given toast mahi as a 4quate matics, | Row minimization. - Column minimization | oiler “ x (s) 9 & 514 1 6 41 0 4 a @ 6 (Al fo w al | 4 0 2 40 2 @ 2 ans “The No’ of ouwig nvacut C5): Onder Dp wat matsiin (s), The Aeluction is optirrum s w ° » = . {3} The ophimurns assitqommt est = 140424145 = The oplimurn allocation is | A i | | | fe } | | Ceeee Tl kook@ 3 Bobs P,@ SR an to be arsignd 4 3 machin x,y qx, The processing cost fon 4ach “job machine combination to thr maltix is given pelow. Delumine the allocation that minimizes the pvualt procerstig cost | Machine | Jobs | | | | Solution .- | oe oy jobs (39 =ENo. of. machune (3) w The given cost, mateinc tk a Aquare malix Row wins Column wiw o BA ow 6 1 3.0 (sy t squat to * [el 9 No. of, otineation Bt onides of Coat malcinr. Qo soluben * timol. - A x Bj pptimurn ansignmnet “i.” Machiie aapino| afentqo Y ho ce BR. x Rl Zz@ | SoWwe Ane jollouing Assignee Operators ahs otf |. Bje 5 4 podfune | o\ 4 4 Ate A ¢ | Solution . NC mathine (4) = No. of. operators @ The given eat malux i a Aquaxe malin. Row min -- Column mine ° 2 67 type i] Z 2 b 3 o 4 1 re xk j fo 3 & 3 soa le oe J Revised mati 1. “ Revised mateix Ts if BP) x x & | s [ol] x 2 x). ee Le K RK PB) makix Se te solution ophimum ophimim assignment st = £45443 = 23 plamin assignment Makin | A 1 operators©) Sole the fodtowing. ayignment psrebler, Machine A Be | oe Ha 7 to 4 , Gl eeeeles Aolution :- ; No op jobs (4) = No. op. machine lw) makers square ‘the given cost takin © Row minimization on 6 2 o 5 o | Revised mala TOchmum wig | mez: ! Machine | le « pl 2 A | 2B | |e flee 2 B 4 2 « Bh D | The no of allocation C4) Fe cqual ty etden 8 cont mater So the Solutier G& optirun he upfinam astignment (ost = 140+ S15 au| A tompany fas 4 machin to A 2 yp, Each jeb can be astigned Jo only One roaching the cost fh wath gob on Geow. spelermine the eh aignment Bat wits tie Avtal tot sath roachine & givy minimize Machine Th Al ig 24 a¢ 32 | Job | ele i2 7 18 | eli 16 19 22 olution - 3) # No. o% mackune (4) No. 01. jobs ¢ The given wat mabix & net 4 Zqua male add dummy = Ow do make a Squase malar | To Hachine 1@ 24 2 32 @ 13 i 18 awe foe tea ee ° ° oO No. of machine (x) = No. 0}. jobs Row . minimization Fe Ea roalnia TE:Revised malein ‘ti oplemum assignment BhoK 46 Jobs | Machin L I) x! | ‘ ‘! KB a ; ° ' a le q 4 ow [el > x No. df allocalinnntai) Spades of tot mabin. Se the splution ts optimum ‘the wplimam assignment cost = 184 13414 +0 t — = 50 Determine the opimum — ausignrnent schedule — p04 assignment prcklim, “The cost maletce dhe following f given below és Machine 7 G9 0 W ¥ A} Wh tr tb ao : Jobs Bj q 7 276 eo} 3 th 15 O12 lb Dia 24 17 28 2 EL a rbsinilge a Solution: - maul MgB gnentotdat mateex its rok cequase rralace CF xo. Atami iwe add dummy Ao, do, rake squat malin i mos te = ao ie 9 en 13 is wb ow wb ‘ oe eo: 34 17 8 2! AQ lo a ip 6 o o o 0 db 8