‘ a i ution , WHICH j; ‘on is called ‘optimal so IS the oe bution method). DI (modified distil cells. ‘The improved solution of the i second stage of solution and can be obtained by initial basic feasible MO! sportation matrix, we allocate 8.4.1 North-West Corner Rule -west) of the trans] pa) hausted or the destination Sep 1 Stating with he cell atthe upper et cores ; as much as possible so that either the Capacity of the first row is ex! requirement of the first column is satisfied, ie. Xj =™" (a, >) ake the second allocation of magnitude Ib, > a,, we move down vertically to the second row and m X59 = min (a, by — x11) in the cell (2, 1). If 6, < @,, move right horizontally to the second column and make the second allocation of magnitude X,, = min (a,, X, —b,) in the cell (1, 2). If b, = a,, there is a tie forthe second allocation. We make the second allocations of magnitude Xp) = min (a, — a, by) = 0 in cell (1, 2) or 2X5 = min (ay, by ~ b,) = 0 in the cell (2, 1) Repeat steps 1 and 2, moving down towards the lower right comer of the transportation table Step 2 Step 3 until all the rim requirements are satisfied.Solution is given by, 7 Xoq = 1; Xa = Nyy = 6 Xyq = 85 Xyq = 2 Mas = MMs 1s M5 Total cost =6x6+4x8+2x9+2% 14 =Rs. 128. 46x 142x4 ae Cost or Matrix Minima Method ist matrix of the transportation table. Let it be Cy Allocate Step I Determine the smallest cost in the co: 34 = min (a, b) in the cell (i, j) If xj = a, cross off the /* row of the transportation table and decrease b; by a;, Then go to 8.4. Step 2 step 3. If xj = by cross off the j* column of the transportation table and decrease a, by 2, Go to step 3. a, = by cross off either the i row or the j column but not both. Step 3 Repeat steps 1 and 2 for the resulting reduced transportation table until all the rim requirements are satisfied. Whenever the minimum cost is not unique, make an arbitrary choice among the minima.8.4.3 =14X14+6x849x941x243x144x2 = Rs. 156, gel’s Approximation Method (VAM) je steps involved in this method for finding the initial solution are as follows. Step 1 Step 2 Step 3 Step 4 Note: If the column is exhausted, then there is Find : ‘ind the penalty cost, namely the difference between the smallest and next smallest costs in each row and column: . Among the penalties as found in step (1), choose the maximum penalty. If this maximum penalty is more than one (icc, if there is a tie), choose any one arbitrarily. In the selected row or column as by step (2), find out the cell having the least cost. Allocate to this cell as much as possible, depending on the capacity and requirements. Delete the row or column that is fully exhausted. Again compute the column and row penalties for the reduced transportation table and then go 10 step (2). Repeat the procedure until all the rim requirements are satisfied. a change in row penalty, and vice versa.steps arerthae te TO CIIOUOR MEOG (IIL). Ie varus involved in MODI method fc for performing the optimality test are given below. 82 (ODI Method 1. Find the initial basi = oe ie initial basic feasible solution of a TP by using any one of the three methods. ‘out a set of numbers wu, and y; ; i : a i for each nee ci % row and column satisfying u . cai ste = with, we assign a number ‘0’ to any row: ee i on Aes I this maximum numberof allocations is more than one, choose ay one ata ep 3 For each empty (unoccupied) cel i f Fer ac spied) cell, we find the sum u, and v, written in the bottom lft comer of ‘Step 4 Find out for each empty cell the net evaluat luation value A, = cy ~ (u is pottom right comer of that cell. This step gives the optimal Bp ae jas o i My >0 (ice, all the net evaluation value), the solution is optimum and a unique solution 5 (if If, 20, then the solution is optimum, but araltemate solution exists. 22 (ity TE at leat one Ay, < , the solution isnot optimum. In this ease we goto the nex Py to improve the total transportation cost. __ Step § Select the empty call having the most negative valve of Ay, From this ell we draw a closed path by drawing horizontal and vertical Hine with the cornet ells occupied. Assign sign + and Perterately and find the minimum allocation fom the cel having Negs° sign. This allocation Should be added to the allocation having positive sien and subtracted from the allocation having negative sign. Step 6 The above step yields a better solute by making one (or more) oocopied cell s empty ant empty cell as occupied. For this new set asi Teasible allocations tepeat fom step @) onwards ‘il a optimum basic feasible solution is obtained. lowing transportation problem. Example 8.7 Solve the fo ion DestOrmanonsRaseacy 18 4 xl dopneacy aa TP and how rssh nat do you mean by an urblanoxd TP Exp hw you woud cone an ublanced TP oa bang 6. Gio be mata orton a7? 7. pin an sgt to sing 2 tansporaton prebem. {© Osin na ectton forth ooving TP unig () NWR (Least cot mtd (VAM Destination a 2 © | Supe 1 2 4 5 source [2 3 3 1 ® a 5 4 7 7 a 1 ° 2 “ Demend | 7 3 * = Tame “ UI) Xa=2, Kae 8. Mea 8, X= i) Xp 8, Xep= 8, Xe = 7, Xe (DX 8: Men = 2. Xen= 8, Xan 9, Nn 14 and the tangpotaton cost. Xoy=7, X= 7 and transportation cost Rs. 68 ee= 2, Xiy= 10 and wanspotaton cost Rs. 60) 102. 8. Sol the folowing TP wher th cll ensies dencto tho unit Wanspotaton costs (usin last cost mead Destination A 8 © 2 | supply 5 4 2 20 origin | e 3 5 7 » a 5 3 4 6 0 Demana| — 10 ° 2 0 | 100 Ins. X10, X= 10 Xa 90, Noy = 10, Ny = 10, Ny = 80. The optimum tansporation cost ls Rs. 4201 10. Sate 72 folowing transportation probiom (east cost method), Destination 1 2 3 | capacity oy 2 2 3 10 2 4 1 2 5 a 1 3 1 * Demand | 20 15 2 (hm 10, ay 18, %y# 2, y= 1, Xe The arpa cot 1=— es | (@yrs tema nin tc HON Warehouse a > a | A wo | 3% 0 10 7 Factory | Fy 70 20 “ o 2 5 | 8 7 2 18 . e |e | ® | F | Avetabie i | sean ° wv foo |e o | 1 8 rotor | 8 [v7 | a pe 7 a 7 fo ° ° " a 0 2 ese sie |e |e (he. Nye Xo x x tone m3) 12. tov 0 weg TP 4 ¢ 2 | Suey | [at 2 3 “ 6 source fpeeeonte |S, 2 ° ® ia iat 2 1 10 | Demers] | 8 8 6 Tare Xp= 8 Ay=2 NyHO Xy=4, Xp= es X= 6, The min, wanspotation cost is Re. 28) 14, SoWve tho folowing TP. aaa Destination [Ta] ee Fe o | source | a | | 6 | » | 2 | . ||. * I 0 25 5 40Ore Rea 10 18. Soe the folowing TP to masini he pro. Destination eas (0 | Supayy | z | = | 100 wo | » | % Le 2 |» | % [oemand| «0 | | «© | 10, Xp=20, X= 50d tho opium prot is R10) goa (na, X= 20, X= 30, Ny 50 X= 20, Xi