Assi 5 a . : , , ree enment problem 'S @ special type of problem whieh deals in allocating the various A ‘ raed items to Various activities on one to one basis «1 such a way that the time or cost ‘volved is minimized and sales or profit is maximised Example: - Sales force to different region, Different bus to different routes, Different machine to different jobs, Different people to different jobs, Assumption: F Number of rows should be equal to number of colu. > One person should be assigned only one job & view versa, > The available resources are finite in number, RUNGARIAN METHOD OF ASSIGNMENT Step ! : Sianing with the first row, locate the smallest cost clewes:’ in each row of the cost lable. Now subtract this smallest clement from each element in that zow, Step 2 Consider each column and locate the smallest element in cach column from every element of that column, Subtract the smallest element ively until a row with exsctly one zero is found, mike an assigninent to this single zero by putting square arousd it and eross out all the “200 appearing in the corresponding coluinn as they wyili not be used to make any other assignment in that column, " 'b) Examine the column successively until a column wits exactly one zero is found: Make an assignment (o this single zero by putting squave around it and cross out all other zero appearing in the corresponding row. Step 4 Draw horizontal and vertical lines neces: y to cover all tl a) Mark‘all rows that do not have any assignment.) b) Mark all columns that have zero in marke ¢) Mark all rows that have assignment in ma d) Draw straight line through umarked row d row. rked column, and marked column. Step 5 Select the smallest element among all the uncovered element. Subiract this smallest elem, Foes the uncovered element and add it to the element which lies at the intersection often Jines and repeat the step 3 to get the required assignment. no: SPECIAL CASES IN ASSIGNEMNT PROBLEM A. MAXIMISATION CASE IN ASSIGNMENT PROBLEM In some cases, the pay off elements of the assignment problem may represent revenue on profit instead of cost so that the objective will be maximise total revenue or profit. ‘The problem of inaximisation can be converted into minimisation case by selecting thd largest clement ‘among all element of the profit matrix and then subtracting it from all other element in the matrix including itself and then we can proceed as usual ana obtain the optimum solution. B. TRAVELLING SALESMEN PROBLEM ‘ Travelling salesmen problem is very similar to the assignment problem except that there is an additional restriction that a salesmen who start from his home city visit each city only Once and returh to his home city. C, UNBALANCED ASSIGNMENT PROBLEM When number of rows is not equal to the number of column, the assignment problem is called unbalanced assignment problem. In suck cases dummy rows or coluran are added in the matrix to make it a square matrix. For example: if five workers are to be assigned to six machines, a dummy row is simply added. The cost on time associated with this dummy row or column is assigned zero elements in the matrix. D. PROHIBITED ASSIGNMENT PROBLEM Sometime due to certain reasons an assignment sunnot be made ina particular cell. For example, a particular machine cannot be installed at a particular to perform. To resolve this we put infinity to avoid assignment in those cells where there IS restriction of assignment. f : :CH) ASSIGNMENT PRoeLem 2D Humgarian Methet D> A Center has Pree empet Prog rarnrie cthe Center leant 3 application prrgremes to, clevclopes. The heat of ithe Computer conten ag Care jelly Steady Org. the re be chevelspe a dhe Computing. hime in vunecta aeqpuded be Mp Pat efor fhe cpplicatien programmes a follows Poepame A Be Pasgremes 1 120 100 Bo . Bo Jo No 2 No 14d 120 S2l4 Hew Cost Madrix ciuatlable Lo Ldentiig dhe Simaliece elemmt “0 Cach w13 Cost mathy and dubbodt it fom each coat war ae: to! 3p Bo Jo { Smaller element fron tach Column A BC | Yo Jo [oy 2 fai .ae 3 ig Qo lo bay 246, 24 B84 qo+lla = 280,5. Colne tte fellow sug CoM! ranps Pranshormecl maXiz A B c¢ pe eee eG | Wo 130 5 qe aon [1 YS 20 BJ US Fe 2 135 Jae 130 Joo ys [2 18) IE te Ie BD Bs fy Ke Is © yl Is % & ¢ ee GQ nOr Nice jas: Fo R&S" | 4yY So 50 Gd Ro lo SSS 35 b6 Soy lee | Now Sel After ees and Column subbact| IC 7 29, 246/494, A b e D eT & shat we lus 3s 0 YS. 30 fomeys) oe ie iL o| US TIIS# Het Setlos 3 30 ce Is 30, 20 \ ~ 83 4 Bis 6 Be ° = £ Qo o ys Ss ie Yds 1s fo) ys 30 ae S| Pe ie 1o Ta 3 30 [ol 1S 20 go 4 TI yy 30 ¥ 5 _ ys IS poe Hee Colter oo. S hes no alacaty Zea Se we have te tanidemed it jn follows crete O Tick Here. that hes ret any amigret zero | een He Cro ss 2e0's tolumn of that ao ticle tHe Om gud cero's WO I Selecta column ipl . step O raw Line On Untttthh wis and Hells atin, (D Select miny nx from ae? of element that au not Avnet © Add mes: element pore jnteuicetier Hy ne change —, and Subbact fron Uneveried Z©) Multiple Optimal Set?!- Tn cthe vedueel asn'gnment matny cf Bt, psa, av Part too ot mane beeye oto grote Off 4 Certay Me of Feros kuch a siteiatlen ineliicares thar here. Boe multiple optimal 4517 freee Serene OPM ral Valen 4 ebfective faa €y1 Solve the mathiy ! 2 a 4 r2 3 Yo S eG Te g@ q 8 a 2) S g 4 SI After ois Keoleewn Subheer 1 a 3 4 Ee oO oO 2 aE oO o oo ir o a of woo ! B ©, S> tte noe of dur Te0 exiF (mn Colter ao nell as me | “en we chook 20 Y of Colum | 1a « OQ 2 2G ae, EY Bw 2 227 7372 ,Y7~D, 12 rR w fa 2 D Bt+64+at 2 = 20 TK wp eB Ww B I 3 ro : (i = & Y Til KR om 2 neo Mw 2 i ye pe ly & oe ee 19? ) 200, Wl, War and Smeg SI epi1) Mayimization in Assfanment P>rbloras- Locerte ~Hhe fretted Largest clement Lo ppt fable ant Subhat por Qu athe veak elements Of Cost matix Irelecdiny thet alse - Q Maylnuiee de Pilots Prof marr A RB Cc D ie 6 ul lo ips 4 2. y 6 fl ls 2 12 S 1s ee t+ 49 Coie |G Te Convert j}4 un mébnimization Subpreeet largeh ba ver IY remy &) e B cpp wn Vow By. was ® C51, 69 2,23, BY, Son Map impt = Bo &(K) ResticHen oh A&gnment | Sometimes ib may happen QA partiadar Aoewree cant be assigned do A partiallar acti. 9, such Care He Cos Of perfemmy that Parnierlar Benistyly co Pactatlar Berm th Crvidins Vey baye Coo). Sy+ ) oly 2 Se Ax lo 26 2 Jo By x Jo 12 2 oe 4 f+ - Ble le oy ye ie Cie 6 oo oe Soi, = After m0 and Glulon Aub heer ignedny x . 93a PO yz c tLe pg oo $2 A, 298, 1a ¢, an 0, E-3) Slod fot M4 ls qis &) Unbalanced A&'gnment !- prherever the Cosh neh} 5 . : 4s met Q Square ren adds WA ana cmmy vs} colin sth 0 entry. de make it balenu and do teryarte, muttoik fet",) Unbaterceeet Fravdling Salesman Prrblm '- “fio? Conspraints t be Pilla city. Jesled hai AB "6b EO No dity nt be vieiled tice oo eS bedpre He four ef al orhes eae J completed -, CPF wy Ti DGotiy from ehy Gh fxs oP yg © oo ee Sat, Mfr Subbact Arid and Coluernn A aS De ae N, Se B oy co fo} é eg oC fs 2 fo. 3 oo i | 2 | eid 2 » F Nod ADE, E53A Which make cys a By) D rot Include now we Change id A : tf 3 é x Now ja fab ves 1 Insienl O So oo eS Oe teanls tn Lieven 44 2 36 if 32 ea € jo 2° x cS Nod = AB, Bac, CP O/D DE, FIA Peareliy Costs 9 435 Y St OD Flo & i“To, Te NO 3 TRANSPORTATION PROR! M1 The transportation iy moraine ate one of the types of the Linear propr:-wming problerr in which objective: 15 te the total transportation wees Of Single homoyencous eommodtity 1 iferent estination in such a way thal B00dS und servines se COs is minimum, The problem involves the transportation of physical distribution of ices from several supply ori Cela APPLICATION OF TRANSPORTATION PROBLEM To minimize shipping cost from factories to warchouse or fi * To determine the location for new factory, warchouse oF st * To determine minimum cost production schedule that isfy limitation, to several de warehouse to retail outlet firm's demand and production NORTH WEST CORNER METHOD (for finding initial feasible solution ) Step 1 . Select the North West Comer cell (upper left vorner cell) of the teisportation table and allocate as :nany available supply and demand requirement i.e. min ($1, D1) 7 Step2 Adjust the supply and demand namber in the respective row and coitiina allocation, Step 3 ‘ exhausted then move down to the first cell in the second row and first If the supply for the first row column is satistied their move horizontally to the next cell in the second column and first row and go to step 2 : Step 4 If for any cell, simply equal demand, then the next allocation can >: made in cell either in the next row oF column. Step 5 Continue the procedure, until the total available quality is fully allocated to the cell as requited. al {esible solut LEAST COST METHOD (LCM) (for i Step 1 Select the cell with the lowest transportation cost among all the row or column of the transportation cost among the entire row or column of the transportation table. If the minimum cost is not unique then Select any cell with the lowest cell. Step2 Allocate as many units as possible to the cell determined in step 1 and ‘eliminate that row in which either capacity on requirement is exhausted. Step3 “Adjust the capacity and requirement for the next allocation, > Step 4: - I the requirem Repeat step 1 to 3 for the reduced table until the entire capacities are exhausted to full aunrement a different destination. VOGEL APPOXIMATION MENTHOD (VAM) (for finding initial feasible solution ) Step 1 Compute a penalty for each row and column in the transportation table. The penalty for a given row and column is the difference between the smallest cost and the next smallest cost in that particular row or column. Step2 Identify the row or column with the largest penalty. In this identified row or column select the cell which has the smallest cost and allocate the maximum possible quality to the lowest cost cell in that row or column so as to exhaust either the supply at a particular source on satisfied demand al a warehouse. ' Step 3 Reduce the row supply and column demand by the amount assignment to the cell. Step 4 Re compute the row and column difference for the reduced tansportation table, omitting rows or column crossed out in the preceding step. Steps Repeat the previous procedure ‘until the entire supply at factories and exhausted to satisfy demand at different warehouses. : MODI METHOD ( for optimising transportation problem ) : Step 1 Determine the initial:basic feasible solution consisting m +n ~ 1 allocation in independent position. Using any of the three methods discussed earlier. Step2 Determine a set of number of cach row and each column. To compute ui for each row vj for each column: Cj 7 ui + vj for each of the m+n-1 occupied cell used in the initial solution. Since there m+n-1 occupied cell used in the initial solution, consequently there are m#n-1 equation involving ¢j, ui and vj. Step3 3 Compute the opportunity cost by relationship = Transporation Problem G) NortH-WESt CORNER METHOD CNWCM)s- 2 find the) Jattiad Qaste Reasibla Arlution of the -pllour'y Ware horse WwW, Wy bsg Wy Capacity ¢Aupply) fF, 14 Ao oo lo 4 Fock) 72 30 4, Go 4 fe Ho - ie Requb- 5 8 a 19 (Demand) Sols “frvst of ate we check He capacity and wq- ane equal by addiiy them Sepratity S Capacity = Fkeq Hemer It ts Balance Now od wh bh Ny Capacity Pistia) 2) sh ta af s “7p “P 2 Up) fe 9[3/o — oe 4 fo) 123 rey ey slo He wy Hence Aoi” 2, q eta | ie ‘ oe © 4 Oe ee ee oe - Fe Yo Zi 4l7y MQ) Ig +6%3e4 3xYo Cons 2.74 ly AIxTeb IY X20 Hew Auocatios gare : = Req, allocations: omrn-1 = Y4Ar-le 6=6 Rene H 4, feovibl RI*(k) Unbalanced Entrvies!-Lohen Supply 4 Demand D Demand “7 Supply. OQ Barmond Add a bummy Row Add a Buminy column wth Cost sero and wih Cod Zer0 and ceepply. Supply =( Demand- Supp) demand = (Supply -demas) oO D Do Os Supp Uy & 4 & g th See, 46 e2 Se g@ le 24 17 Demand 72 I> W Git total Supply = TAB 247 7 225° a otal Demamd= q2+Hlorty) 2s Demand < supply we add a2 dummy Column wth Coat entry O Demand = 139-2152 20 ope ULL MM ee MU pe Si Teta 443) oT S. oo 16 oO —%2]0' St ye 16) 42H) 200) ad | Demal 7}p "02h 20 So Hut allocated -rourt & Colurns= 6 And mMin-l= 6=6- Honce TBPS wb \ T2XY 4+ YKB + B2xK24 FICK /6 +1 ¥2y F20K 0 = 32k ‘D> Yeast Coct Method (Mahix Minime ) Of cole tae following using Lom | Dr Do Da Dy erprdig Ss. 6 Y | 3 1y & g 9 2 7. "6 & Y 3 c a g Den ¢ lo 1s Y eal 5 Supply =F Berend, 7 é ats And We choos the min enby fromthe Cost 17) give HRs allecatien fk and acpecdt te pros Pa VD} Oy Suppl Si 0 9 a a io = S2 Gls) 904) 104) [6Jislo 42 +336 Spire Demand ¢ o = Ie/9Jo Shilo Jo fe PAs Here allecthen = 6 Res. ablocahiens Min-| =U43-1= 6 DMXIF EK BET T + IK IX34 YR2 =) JY4YSte B14 24348 Dist && Vogels A pprexi'maticn Method, )- DPind pers of By, Oa ey Supp a 12 fey i) chee Co ig 13 1Yy Jo 3p Oo; (21 ay 13 al Dement 200 as gas 2% Oa Sold dae S Pemond = & Supply tenallest 20 Nem We caleutate Penalty by subbectig Ie emtrica Dr Pa Da Dy Supply p,| P2-| P3 ty @ Orsi 560R) TF IY asuy . . 2 2 Wb lac) IY get} 0) “eee —3- fe | 4-[e - 3 & ai 24 UdDaStORS Yoo | Y [3] 3 3 Dems Sealy dakfag 27S 260(ns - e a 5 1 Oo +4 a, o aa | ° | LY Pa — b . I ° Py = = I ° — _ 13% Jo Hence Pb Bcatlae | bo bo Dg Dy Sup pl¢ No + of ‘ ©; coi) 5013) Te ad 280 rus = 6 On 1G 1501) «TY Pree) B00 ae) mae" Or 2) ZY -975lp) Jasi) Yoo Mane Ha cap Dem Qoojo gas 296 250 = Dooxil+ So L/QHUTSKI St [2x1 oF 2ATSYIBF P2SKIO = |2071S(OPTIMUM SoLuTION Moni ME THEN OH" Pind TASS Lsry Vogele and thes Pinel optim tim Aol” Di D> Os Dy Supp ci 19 30 Su lo a) Sa; To Be «(Yo 6o 4 wo 060 G 75 5C in ae fe tek 4 zers udy VAM o Ds Ps Dy Sopp ep Si. SGI? 30 So 210) ie oe Bo fui)’ 2fte) 49 Ss Ye 88) \ Fol” Joos * ig Demand 5 g + 4 24 Now we Check optimality by ealiy mt n-le 34 yal 24 No J qllocatu = 6 ! AU He aWocatias at at Fncipendet Positins to Yind ul and vj ving the formule Cue Hr cg T= Cy Tn Cetumn or rd betuch He mar give At 0- , bal [ein | [37s Tf co [s] foo | q —-h -» oO Te find dif= aif Cucryp) [fee ise it} Jo oly! ae net Za bs La ner a obhimum ar Ba enty eh Hur all uk 6Dp bs Da Dy Supply S; 5€Iq) 30 50 210) + -O S20 +0 (30) 1l4e) 2b) F % Yo S(O a5, 1m, 18 Ven § eo Gi 4, 34 min (2-88 -b) =0 Oz fo Dr Pa Dg Oy. upg S801) 30, 50 200) S2 Jo 23) 4) ¢o F Ss Yo 6/8) “lo Dem 5 38 toOOIY Nod agaco pind wi, & vf, and tren AG pe chik ephrral'y ue 19 Jo |lo 30] 44 42 20 18 Hee all Ai 20, So it ts He optimum oh Hence SXIGV4+Q2Xl0+2ZY 30 49KY4O ACY 8 4 )2pde D743 he(1) Ste ppsrnig- Stove Methed+~ &y Bind an eptimal fot? ly D D> Da Seep pp Si a =) S. 3 a | g ee ee CCV 3)I= 4+ 4-24)-2 =] catel COa243-j42-1- 3 C02) = 43142 -142-T2-2 C38 = 45 24 7-y%6 CO) = 4 7 24) 247 ~Yn F C4) 2-)= Ag-1tr2e 729 Het one alecated valuc Ls orga Se Oe Q ebtimam sn Le dn pre this we Aelect nege of A be Belecting Dor vee = Bt Add wheel, and subfrack whee J.ale ial Oo Chege CCtr2) H47-341-24]-22 2 CCU BD =4 4241-21 CCQ) = 4 3-)42-153 CCB AS -Y4 BI 42-12Y Ceo CGtre) = 7 6211-3. 2 dtu ells Ai pie is Mun Cosy = QE BvDPICT YS FI M2 p 2M Ir =F. \