Transportation Techniques. ‘Transportation Problems ‘ Transportation problems are particular class of allocation problems objecive in these problems is to transport various amounts of a homogeneous commodity that are stored at several origins, to a of destinations. The transportation is effected in such a way Se a ee eee ite ta pnchy of eh 3 ‘origins and that the total transportation cost is a minimum. Eg: A manufacturing concer has ‘m’ plants located in ‘m’ different cities in India. There are ‘n’ retail shops in ‘n’ different cities of the which can absorb all the products stored. Then the transporta- Speen Secretar sh ha _ cost of transporting the manufactured products from various ‘ to various retail shops. ‘The name * origins as O,, O», .... O,, and destinations as D,, Ds, quantity produced at the origins be respectively a), a, . ty + tt =b, +b, +... byor Fam Tb. con etusprtn 6 oe nt om te i ‘can be presented in a matrix form as:i‘ D, D, Available Py i Ga By rik 8h . Chet re Gallas 0) 2 LG Ca c a NaH GA: Ce Son ay Required b, by by This matrix is known as Transportation table or Cost effectiveness matrix. Here ¥.a, (Total available) = y b, (Total required) The problem is to determine the quantity X, to be transported from the ‘i’ the origin to ‘j’ th destit isminimum. -s ition such that the total cost TG Transportation problem in the form ofa L.P.P. (Mathematical formula- tion) Let x, be the number of units transported from ‘i"h origin to ‘j" destination. C; be the cost for transporting one unit from ‘i’ origin to ‘destination, Let ‘a,’ betheunits available in ‘i origin and ‘bj’ be the units required in ‘j’ destination, Then the problem is, moo A inmie ze se Minimise Z ha ja COX Subject to Xj > 0 fori, j Basic assumptions in Transportation Technique 1 fa 5b . Thatis, total quantity available for distribution is eqal to total requirement in different destinations together. 2 The unit transportation cost from one origin to a destination is 3. The unit cost is independent of the quantity transported “ Objective i to minimise the total manspontcion enUses of Transportaion technique 1. To minimise transportation costs from factories to warehouses or from warehouses to markets 2 To determine Jowest cost location for new factory 3. To determine minimum cost production schedule. DEFINITIONS Feasible Solution: A feasible solution to a transportation problem is a set of non negative individual allocations which satisfy the row and column sum restrictions. Therefore, for feasibility, the sum of the allocations in the rows must be equal to the availability in that row, Similarly sum of the allocations in the columns must be equal to the demand in that column. Basic feasible Solution: A feasible solution to amxn transportation problem is said to be a basic feasible solution if the total number of allocations is exactly equal tom +n-1. Optimal Solution: A feasible solution (Basic or not) is said to be optimal if it minimises the total transportation cost. Non degenerate basic feasible solution: A feasible solution of amxn transportation problem is said to be non degenerate basic feasible solu- tion if (1) the number of allocations is equaltom+n—1 Q) the allocations are in independent positions. Loops in transportation table (Non - independent position) ‘Allocation are said to be in independent positions, if it is impossible to increase or decrease any allocation without either changing the posi- tion of the allocation or violating the rim requirements. Therefore when the allocations are in independent positions, it is impossible to travel from any allocation back to itself through a series of horizontal or vertical jumps. For example: Table II In the table 1, the allocations are in independent positions. In table I and III they are not in independent position.D.4 Transportation Problem 5 aie table with ‘m’ rows representing the origin nting the destinations. ion to the problem. Steps for solving a 1. Set up a transpo! and ‘n’ columns represel h Develop an initial feasible soluti 2 A ion i 1 or not. . Test whether the solution is optima F A If the solution is not optimal modify the allocations. : 5. Repeat steps 4 and 5 until an optimal solution is obtained. NOTE: If there are ‘m’ rows and ‘n’ columns, there will be ‘mn’ cells (or spaces). Each cell is known by two numbers one representing the row and the other representing the column. For example, cell (2, 3) means the cell falling in the second row and third column. Initial basic feasible solution Initial feasible solutions are those which satisfy the rim require- ment. That is, the allocations made in every row taken together is equal to the availability shown in that row. Similarly for each column, the total allocation should be equal to the requirement in that column. The initial solution can be obtained either by inspection or by some tules. The commonly used methods for finding initial solution are () North west corner rule (2) Lowest cost entry method (matrix minima method) (3) Vogel’s approximation method (Unit cost penalty methd.) North West Corner Rule Procedure Step 1: Allocate to the cell (1 1) maximum Possible amount which is minimum of row total and column total. So either arow or acolumn total gets exhausted. So cross off that row or column as the case may be. Step 2: Consider the reduced matrix. In that matrix, allocate to the cell ¢ vi Kap amount (which is minimum of present row total Step 3: Repeat the above exhausted. Ex. 1: Find the initial feasible soluti , lution t i given below, by north west corner rule. oe - steps until all the available quantities are Origins pesinaton 0, mt us D; Supply : . oO, a i 9 18 xDS Ane Allogate to cell (1, 1) mini. mumofSand 7ie 5. Thus ©, row total is exhausted, sine the supply of O, is co- pletely met. So Cross off the row O| Consider the reduced matrix after deleting O, row, Now allocate to the cell (1, 1) min of 8 and 2 ie 2. Thus col- umn D, is exhausted and it is crossed off Consider the reduced matrix. Allocate to the cell (1, 1) min of6and9%ie6, ThustheO, 0, D, 6 3 row is crossed off. Ogre o,| 6] 2 | ¥ 18 Allocate to the cell (1, 1) Di Ds min of 7 and 3 ie 3. Thus Pa] the D, column is crossed off. O, 1 7 o_6 fT 2 | 14 3A Finally allocate 4 to cell (1, 1) a: and 14 to cell (2, 1) O; 7 4 14 Oo, 2 4 18 ‘Thus the various allocatins made to the cells are shown below and the solution is 5 Total Transportation cost = 8 (5x2)+(2x3)+(6x3)+ (3x 4)+(4x 7)+(14x 2) os | Mu =102RsD.6 od Lowest Cost Entry Meth: : i in the matrix. Allocate th having the lowest cost in ed Choose the cell, ie the minimum of the row total and column ich as possible whicl J i. Thus er arow total or acolurnn total is exhausted. Cross off the corroaponig row or column. From the reduced matrix, locate the cel having the lowest cost. ‘Allocate to that cell maximum Possible, this wag to a further reduced matrix. Continue this process until all the available quantities are exhausted. Ex. 2: Find the initial feasible solution to the following transportation problem by lowest cost entry method. WwW, WwW, Ws R [2 7 4 5 mR |3 3 4 2 Me le a 2 7 KR 1 6 2 14 7 9 18 Ans: The lowest cost is 1 in cells Ww, W, W3; (2,3) and (4, 1). Select one F, 2 7 4 5 of these say (2, 3). Allocate F, r 8 min of 8 and 18 ie 8. Thus 3 3 1 the total of row F, is exhausted. F3, 5. 4 7 z So cross off the Row F). Fy 1 6 3 14 7 9 18 The lowest cost in the red- uced matrix is in the cell F, 5 (3, 1). Allocate min of 7 F; 7 and 14 ie. 7. Thus the total of column W, is exhausted. F, 14 Cross off the column W,. Allocate to the cell (3, 2) Finally allocate3 tothe cell min of 7 and 10 ie 7 and Allocate to the cell (1, 2), 7 to the cell (2, 1) (2, 1) units 7 and 2 to the cell (1, 1) w, W3The solution is Wi Mats } 2 is Total transportation cost = FR 12 7 405 8 (2x 1)+(Bx4)+ F, 3 3 1 8 (8x 1)+(7x4)+ a (7x 1)+ (7x 2)=Rs. 83. Fs 5 4 7 i {1 6 4 Vogel’s approximation method Step 1: Under this method we write the difference between smallest and the second smallest costs in each column below the corresponding col- umn, within brackets. Similarly write similar differences in each row to the right of corresponding row. These differences are known as penalty. Step 2: Select the row or column having the largest penalty and allocate the maximum possible amount to the cell with lowest cost in that row or column as the case may be. Thus either the row total or column total is completely exhausted. Cross off that row (or column). Construct the reduced matrix with the remaining row and columns. Step 3: For the reduced matrix obtained, apply steps 1 and 2 unit! all rows and columns totals are exhausted. Note: The initial solution obtained by Vogel’s method is more close to the optimal solution than the solution obtained by the other two meth- ods. Ex.3: Find the initial solution for the Transportation Problem by Vogel’s i To Ww. W;_ Supply F, 2 7 4 _ F, 3 3 1 8 Fy 5 4 7 7 Ky 14 Demand iB, s 18 Ans: Write penalties in brackets for all columns and rows. Penalties For rows: 4—2=2,3-1=2,5-4=1,2—1=1. For columns 2-1 = 1,4—3=1,2-1= 1. These are shown in brackets. DOAKD.8 Maximum penalty 2 is associated with row F and row F>. Select any one of these say row, Fy Allocate min of 5 and 7 = 5 to the cell (1, 1) which has the lowest cost in the row F). Cross off row F). Maximum penalty 2 is asso- ciated with row F, and column W,. Select any one of these, say row F). Allocate min of 8 and 18=8 tothe cell (1,3) which has the lowest cost in the row F,, Cross off row F>. Maximum penalty (5) in col- umn W;. Allocate 10 to the cell (2, 3). cross of column W3. Allocate 2 to the cell (2, 1) w, W2 Ws F, 4 15Q) Elo 3 jo 1 | 8) Bl Jig T_| 70) F,_1f 6 [2 |140) a 9 18 Oo a @ WwW, Ws; F| 3] 3 | 1 | 8@ < Bi 51. 4 7 |70) Filan on 214) a a 18 oa @ Wis Wr Ws , G4 ag 7) a) RU | 140) a 9 10 @ ® © t Allocate 2 to (2, 1) and 7 to (1, 1) WwW, Wr Wr Kj 7] 70) 7] Ky an a Fr, 6 aoe 2] eae Fy 6 | 2 4 ® : Thus the solution is Wie Wye Wy F, 5 Total cost Ey 8 =(5x2)+ (8x 1) + (7x 4)+ Bs 7 2x 1)+(2x6)+ (10x 2) Fe 4 =10+8+28+2+12+20 80Rs..D.9 Optimal Solution By applying Vogel’s method or Lowest Cost Entry method or North West corner rule, an initial feasible solution can be obtained. The next step is to examine whether the solution can be improved. For this, we conduct test of optimality. There are two methods availabe for testing optimality. 1) the stepping stone method. 2) the modified distribution method (MODI) We shall try to solve all the problems in this book by MODI method. MODI Method Step 1: When the initial basic feasible solution is obtained, some cells are occupied (ie allocation made) and others unoccupied. Number of occupied cells ism +n—1. Let C, be the cost of the cell (i, j). Then we determine m + n numbers called U; and V; values, by form- ing m + n— | equations of the form U; + Va corresponding to each occupied cell. For example if one of the occupied cells is (2, 3), then the equation is Up + V3 = Cos where Cos is the cost in the (2, 3) cell. For solving the equations, we take one of Uj; or V, values as zero (Since number of unknowns is one more than the number of equations.) Step 2: Then we calculate cell evaluations known as d,, values for unoc- cupied cells, by the formula dy = ¢, -(U; + Vj) Step 3: [fall d; values are positive, the solution is optimal and unique, if at least one of them is zero and others positive the solution is optimal but alternative solution exists. If alteast one dj; is negative, the solution is not optimal. Step 4: Ifthe solution is not optimal, make reallocations. Give maximum allocation to the cell for which d,, is negative, making one of the occupied cells empty. Then we repeat the steps 1 to 4 until solution becomes optimal. Ex. 4: Solve the following transportation problem To Supply i 1 1 1 2 fi 4 5 2 3 3 T 8 From 3 5 4 7 io 4 1 6 2 14 Demand 7 9 18Ans: We have solved this problem by Vogel’s Method (See the Ex 3, done in page 7) Initial solution then obtained is I Ol Mi Supply 5 fee ea 1 5 8 2 3 3 1 8 7 3 5 4 1 ’ Sale| ong 1 4 1 6 2 4 Demand 7 Op. ls To test the optimality: Occupied cells are (1, 1), (2, 3), (3, 2), (4, 1), (4, 2), (4, 3). The costs in these cells are 2, 1, 4, 1, 6, 2. Therefore the equations are. U,+V,=2 U,t+V,=1 U,+V3=1 U,+V. U;+V)=4 U,+V3=2 Take any one of U or V values as zero, Say U, (which occurs more number of times) be ‘zero’. When U,=0, V, = 1, V.=6, V3 =2, U, = 1, U)=-1, U;=-2. Shown below are three matrices, (C;), (U, + V,), (d,). The (C,) matrix is that containing costs of all unoccupied cells, (Uj + V;) matrix is that containing U; + V, values for unoccupied cells. (d,)matrix is that contain- ne the difference, (Cy) - (+ Vi) values. The occupied cells are kept lank. oD W+V) ui pyH4 L627. 1+2=3 I 3] 3| x 12655 a 5 7 1 z SS eantmles x] x] x 2 a 5 Mire 2 6 d= Ci-(Uj+ V) a 4-3=1 x 7-0=7 | = x | x values is negative the solution is not optimal. Since one of dyDl Make reallocations. Give maximum possil i ible all where negative d, value occurs. ie the cell, 2) mete Consider four cells shown below. Transfer 2 from (4, 11 J to (2, 11). Cor- respondingly subtract 2 from (2, 111) and add 2 to (4, 111) Y 0 Il +2 8-2 2 6 2 3 1) 8 3 Tes 2-2 10+2 = 2 4 (| ae an 6 [fen l2 2, 18 2 18 The revised allocation gives the following matrix. I Il tl a] 5 1 6 8 2 3 7 ut # 3 -) 4 7 i) fete || 4 4 1 6 a 7 9 18 To test the optimality again; the equations of U, and V, values of occupied cells are 2 Put U, =0 so that V3 =2, vig U, = 1,U,=-1, V2.=4,U3= Us+V3=2 The matrix for Cy, U, + Vj values of unoccupied cells, and dj matrix are C oe ( i A es 2+1=3 | 1 Bil, (-1=1 x se = | x | a 0+2=2 | 0 | 4|x« 5 x} 6] x 0+4=4! x o [x] 21x yo! 4 No dj value is negative. Therefore the soit is optimum. There- fore the optimal solution is From 1 to! : 5 units From 3 to II : 7 units From 2 to II : 2 units From 4 tol :2 units From 2 to III : 6 units From 4 to Ill : 12 units syeiey)D.12 The total transportation Cost = (5 x 2) + (2x 3) + x 1) + (7x 4) x 1+ (12x2)* 26.00 Ex. 5: Solve the following. ‘Transportation Problem To Available 20 30 From ie 13 Required 40 6 8 18 6 ‘Ans: To find the initial basic solution. Let us apply Vogel’s method. Tablel Wes Wy te We Wa ee F, a 8 9 20 (1) | 8] Bro 10 1 5 8 30 (1) Fe? I | 0 3 15 (4) FR, [2 T 2) 6] 3) % 6 8 8 6 @ G) ©) G) 6) f Table We Wega F, 13 4 8 20(1) F, {2 10 s | 2203) 6 Fy [7 u_| 40 3 | 15(4) F, [2 1 4 16] 13(1) 40 6 18 6 Se eG) 5G): ? Table IV aw Ir Cee 1 Ce 8) 20(1) 2G) ||, | 2 Ts | 20) Ce 94@)<|| F, z 1 Bay 13) oot aa © ® 8) iDAIS TableV Table VI Tuble Vil Wi We WwW, Wy w, Ww F318] 206) || aT a] 8 T RL 2] 5) 2e i" 20(5)« | 2 }] 2 q is Fy 4 | 7(12)< || F, | 2 2(3) 3 18 it “le © @ YM ® The initial 3FS is Ww, Wee By OM; {20 ay 3 4 6 8 9 » 4 Lal (8 f FS [2 10 iis 8 30 5 3) F;[_7 ul » 40 3 15 ed 6) Fy 2 1 9 4 16. 3 40 6 8 18 6 To test the optimality For occupied cells the equations containing U,V, and Cy values are U,+V)=3 Put U,=0 U,+V,=2 then V,=2 U,+V3=1 V3=1 U,+Va=5 Vy=5 U;+V,=7 U;= U;+V5=3 V5" U,s+V,=2 U,=0 U,y+V2=1 V2= U:= (Ci) matrix, (Uj + Vj) matrix and (dj) matrix for unoccupied cells ) W,+W) U, (ai) x. 618 |9 1 0 s 0 x |x | 9 [14 6 Meu chose No. d,, value is negative. Therefore the solution is optimal and the optimal solution is éD4 ; wea F, to W, : 20, F) to Mi Fu; 8, F:to Wy: 18 F, to W, :9 ey . om, F,to W): Total danaphationcost= (20% 3) (4x 2)+ (8x 1)+(18x 5)+ (9x 7 (6x 3)+(7x2)+(6x 1) = Bs.267 Ex. 6: Solve the following transportation problem whose cost matriy availability at each plant and requirement at each warehouse are given as follows: Ware house Bhat: Wie War? We Wa Availability P, 3 70 P, 700 «300 400 600 90 P; 400 100-600-200 180 Requirement 50 80 70 140 Ans: Applying Vogel's method we get the basic feasible solution. (Stu- dents may try and get the following answer as in Ex. 3:) 2 RS a ae P, {190 | 300 | soo [100 D any P,{_700 | 300 |” 400 9 BE) | 100) P3| 400 100 600 200 180 0 wo 7 10 Test of optimality: Equations for U, and Vj values for occupied cells. U,+V,=190 U,+V4=100 U,+V;=400 U,+V,=600 U;+V,=100 U;+V,=200 Put V, =0, then U, = 100, U, = 600, Us=200, V, =90, V,=-100, v;=-200 For unoccupied cellsDIS ince one dj, 1s negat Sint r aie : gative the solution is not optimal, Thus 4 ake reallocati : aximum possible value to the cell (2, 2) having nega ive ‘diy _ For this transfer the allocation of 20 now in the cell Q 4yto cell (2, 2). Then make changes in the two allocations of last row. ‘The new position of the solution is wr Wa Wy, Wy OOO |e 200 180 0 80. Ww 140 Again testing for optimality: The equations containing U, and V, values for occup ed cells are U,+V, = 190 U, + V4= 100 Put V,=0, U, = 100, U, = 400, U,+ V2 = 300 U, = 200, V,=90, V2 "100, V3 = U,+V3=400 U,+V2= 100 U, + V4=200 (U,+V)) U; (dj) Ei fete 100 fi soo 400] x_| x__|4o0| 400 |2101 x x _|200 29 200 | x_} 200 iio} x [400] x _ V, > 90-100 0 ) . ’ . Since no dj value is negative, the solution is optimal. The optimal solution is P, to W, : 50 units P, to W;: 70 units P, to Wy: 20 units P, to W) : 60 units P, to W, : 20 units Pp, to Wy: 120 units Total transportation cost = (50x 190) + (20x 100) + (20x 300) + (70x 400) + (60 x 100) + (120 x 200) = Ex.7: The following table shows all the necessary information on the available supply to each warehouse, the requirement ofeach market and the unit transportation cost from each warehouse to each mat rket.Market I Bi oie wv. Supply Te A 2 4 3 22 2 4. ig aa 6 15 ie GG Tie iS 8 Requirements 7 12 17° 9 The shipping clerk has worked out the following schedule from experiznce: 12 units from A to If, I unit from A to IIL, 9 units from A to 1y, 15 units from B to III, 7 units from C to and 1 unit from C to III, (a) Check and see if the clerk has the optimal schedule (b) Find the optimal schedule and minimal total shipment cost, (©) Ifthe clerk is approached by a carrier of route C to II who offers to reduce his rate in the hope of getting some business, by how much the rate be reduced before the clerk should consider giving him an order, Ans: The initial basic feasible solution is provided in the problem as Pe Mone Teed i) A i (PRS REE ea leo) [15] B 4 8 RIS eons | is rt 1 iC Aile='6 1 5 8 7 2 17 a (a) Test of optimality For occupied cells, equations connecting U; and Vj values are 4 +v)=2,u +V¥5=4,u, + vy =3 Wy +¥5= 1, U3 +¥,=4,u; +v3=7 Put u, = 0, then we get other values = -3,Us=3, v= 1, ¥)=2, v5=4,v,=3 For unoccupied cells, i) PER [x] 6 xls x16 . Vos Qog ‘ere one ‘dj is negative. So the solution is not opti r : n optimal. So make oa Give maximum Possible to the cell with negative ‘dj’. There- fore ra the cell (3, 4) Occupied. The new solution when reallocation is2) [2] Te A Rela! os 15 B me kd gs | 7] 1 . Bi gao7, 5 Test of optimality: for occupied cells the equations are U, + V)=2,U, +V3=4, U, + V4 =3, U,+V3=1,U;+V, =4,U;+V,=5 Putting U; =0, V,=2, V;=4, V4=3, U, =-3, U;=2, v, =2 For unoccupied cells: (i) (Uj+V) U; (dj) a |x. x] Bi} 5h] 30), Be i 4/8 |x! 6 -l|-1] x] 0} -3 519 } xe) 6 Benne: |.7.| x Sipe) 5e.a] SAS [GH] ose] -2 EERE Mie au 24s Since no ‘d;;’ is negative the solution is optimum. ©. (0) The optimum schedule is Ato II: 12 units Bto Ill: 15 units Ato III: 2 units Ctol:7 units Ato IV : 8 units CtolV: 1 unit Minimum total shipment cost =(12x 2) +(2x 4) +(8x 3)+ (15x 1)+ (7x 4)+(1 x 5)= Rs.104 (©) Total units to be transferred from C is 8. Present cost = (7x 4) + (1x 5)=Rs. 33. Therefore unit cost = 33 = 4.125. So the carrier must Teduce the cost of transportation to 4.125. Now the cost to transfer a unit from C to II is 6. Therefore 6 is to be reduced to Rs. 4.125 ie 4 Ex. 8: ABC limited has three production shops supplying a product to five ware houses. The cost of product varies from shop to shop and cost of transportation from one shop to a warehouse also varies. Each shop has a specific production capacity and each warehouse has cert- ain Amount of requirement. The cost of transportaion is as given below. ey) el ey.D.18 Warehouse I a x} ¥ Capacity ca ie ie fe co 175 Reqd: 60 80 85 «105 70 ‘The cost of manufacture ofthe product at different production shops are Shop Variable Cost Fixed Csot A 14 7000 B 16 4000 c 15 5000 Find the optimum quantity to be supplied from each shop to differ- ent ware houses at minimum total cost. Ans: The fixed cost need not be considered for minimisation. So the cost is the sum of the transportation cost and variable cost. Cost effec- tiveness matrix is. 6+14 4414 4414 7414 «5414] 5+16 6+16 7416 4+16 8+46 | A415) A415 86 CAs coetaine Ar Esa . Solving the problem JM ws Vs Capacity ACS 20k ena e an rag 100 Bs 2k Weegee aoe 0. ok 125 Cogeiig CTC Beane Cee ie 17s Regd: 60 8 88 «6105. 70 Applying Vogel’s method the initial solution is (Students may try) and arrive at the following solution. : |_20 | 100 2 iy - an 175 19 oa O82 SS 0 Students may apply test of optimalit They notoptimum. Therefore the revised allocation ve aD.19 Again applying test of optimality, it can be seen that the solution is not optimal (Try yourself). Making reallocation again we have 5] [85] 20 18 18 21 19 | 100 { 65] @ 21 2 B 20 24'| 125 a 45 18 19 21 18 19 175 oO 80 85 105 70 Again applying test of optimality, the solution is not optimum (Try yourself). Making reallocation we have 15] [85 20 18 18 | 21 19 | 100 2 105. 1 B 20 125 @} [45 18 19 21 18 175 oO 80 85 105 2 The solution is now optimum. (Try yourself the test of optimality) Optimum solution is A to I]: 15, A to III: 85, B to II: 20, BtoIV : 105, Ctol:60,Ctoll:45,CtoV:70 Total cost= (15x 18)+(85 x 18) + (20x 22) + (105 x 20) + (60x 18)+ (45x 19)+(70 x 19)= 2605 Degeneracy in Transportation Problems Ina transportation problem, degeneracy occurs whenever the num- ber of individual allocations is less than m + n — | where m and n are Tespectively the number of rows and columns of the transportation ma- trix. Degeneracy in transportation problem can develop in two ways (1) The basic feasible solution may be degenerate from the initial stage on- wards (2) they may become degenerate at any immediate stage. In such Cases we allocate A to one or more empty cells so that the total number of allocations ism+n-—1 (A isa very small number almost equal to zero.) Ex. 9: A manufacturer wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin O to the destination D. A B.C Available x 50 30 220 1 x PDs 455.170 3 Z 250 200 50 4 pte dis 2 22 Shipping costs are Rs. 10 per load mile. What shipping should be used. Ans: By ‘Vogel’s Method’ we get the following initial basic feasiblep.20 ss aconnate may try and get this solution as jy x4) A 4 2 2 Since the total number of allocations is 4 which is one less than m~+n-—1 (= 5), the solution is degenerate. Now to resolve this degeneracy, we allocate a very small amount rt to the cell (2, 2) getting 5 allocations at independent positions. ©. The new solution is x 1 Y 3 z 4 Testing for optimality sy Vers nnn’ Usand V, values for occupied cells U,+V,=90 Solving U, = 0, U, i =0,U; =-195, U,=-155 U;+V,=45 Vi omsivcann neta U;+V,=200 1=245, V.=200, V,=50 U;+V;=50 2 minimum cost Rs 10, = 19600 ne anne)D.21 Unbalanced Transportation Problems A transportation problem is said to be an unbalaanced transporta- tion problem, if the sum of all available amounts (quantities in all origins together) is not equal to the sum of all Tequirements in all destinations together ie Dai # 5b. An unbalanced transportation problem is converted into a balanced transportation problem, by introducing a fictitious source or destination which will provide the surplus supply or demand. The costs of trans- porting a unit from the fictitious source (or to the fictitious destination) is taken to be zero. After converting the unbalanced transportation prob- lem to balanced transportation problem, by the introduction of fictitious source or destination, it is solved by the earlier methods. ‘Transportation problems are unbalaced when: (1) supply is less than demand: If the total capacity of the origin is not enough to meet the requirement of destinations, then one or more desti- nations will not get necessary quantity. This results in lost sales, and losing customers. This situation can be handled by introducing a dummy origin. The cost of shipment from the dummy origin to each destination may be assumed as zero. (2) supply is greater than demand: If supply is more than the demand, the profits are reduced by the loss caused by the unsold quantity. In these types of problems dummy destinations are introduced to absorb the excess capacity of the origin. Since no shipment is involved, the transportation cost from the origin to these dummy destinations is zero. Ex. 10: Determine the optimal transportation plan from the following table giving the plant to market shipping costs and quantities required -at each market and available at each plant: Market Plant W, w. W; W, Availability F, Lope lie 50 F, 21 16 10 12 40 F, 8 12 18 9 70 Requirement 30 25 35 40 Ans:Here total requirement of the market = 30 + 25 + 35 + 40 = 130 and total availability at the plants = 50 + 40 + 70 = 160 Since the total availability is 30 more than the total requirements, this transportation problem is unbalanced and so we convert this prob- Jem to a balanced one by introducing a fictitious market W, with require- ‘Ment 30 such that the cost of transportation from plants to this market sare zero.D. 22 transportation problem is given below. -. The balanced : Market er Pune Wyre War Ws 4 Ws sa F, in | 8 0 : F, 21 16 10 2 0 F; 8 2 18 5. 0 eh i. Required 30 3B 35 40 30 By ‘Vogel’s method’ we get the following initial B. FE solution to the problem. [Students may try and arrive at this solution as in Ex. 3.] Market Plant W, W2 W3 We W. 35] F n| ait 7{ 8] 0 |0 10] 30. Fr 16 | _10 0 30 25 15 F3 8 12 18 Di i} 30 3 35 40 30 It can be seen that the solution is optimum. [Calculations are left to the students as in Ex. 4:) Total transportation cost = (25x 7) +(25 x 8) +(10x 10) +(30x 8)+ (25 x 12)+(15x 9) Rs. 1150 It is important to note that 30 units are despatched from plant F, to market (Fictitious) Ws. In other words we can say that 30 units are left undespatched at the plant F. Ex. 11: A steel company has three open hearth furnaces and five rolling mills. Transportation cost (rupees per quintal) for shipping steel from furnaces to rolling mills are shown in the following table. Rolling Mills MM, _M;__My Capacities F 6 1 9 3 Fi rR AT Soe 2 3 ee i NO NRL as A aoa, 70 ‘3 Requirement 85 35 50 45 i An Here total requirement (215) is more than the total capacity (195). 0 the problem is unbalanced. So introduce a fictitious row Fy with requirement, 20, The balanced transportation problem isD.23 M Meo - i * cer eee ses Poe (tL 5 | oe. 55 F [Olmwa |e 4 [07 ” rn Dies Oen0 le 0 » Requirement 8&5 35 50 5 45 By ‘Vogel’s Method? we get the following initial B. F. S. of the problem. (students may try as in the case of Ex. 3] M, M, M; My, Capacities 2 F, Fee 98013) nv 30] [25 F, TL [Ges Dla o8 55 By] [4s F; TO ea [ve 4. 7 w » Fy 0 0 0 0 2 Requirement 85 BS 50 45 Applying the test of optimality we find that the solution is not optimum. (Students may try the test of optimality as in the case of Ex. 4) The revised (optimum) solution is 40] [30 pul epende| ss 13. D S| | (ees: o2 55 | 25} ity fa 72 7D a » pbeeaOs | 20010. BSS 313), Me 85 ‘Total transportation cost = (40x 6)+ (30x 1) +(5x 5)+G0x 2)+(25 x 10)+ (45x 7)+(20x 0) =240 +30 +25 + 100+ 250 +315 +0= 260 Rs. Maximisation in Transportation Problems A transportation problem in which the objective is to maximise, can be solved by convertingthe given maximisation problemtoaminimisation pro- blem. For this, select highest value and subtract all other values from this highest value. Then the given problem becomes minimisation Problem. Ex. 12: Solve the following Transportation problem to maximise profit. 2024)Dw Profit in Rs/Unit Distribution ok c D Supply echiecaet ae es oe RS aE et ie ia 44 3 (90. 40,66 60) “98 Demand 23 si 16 30 ‘Ans: This is a maximisation pro! problem. For this select the highest profi figures from 90. The modified matrix Is lem, So convert it into a MINIMIsAtion it, 90 and subtract all profit B w a Applying Vogel’s approximation method, (try yourself), initial solu Ao eto 1 i Re 2 bo ae a 3 Oh oe Boa 06: a tion is AOR Gs op 1 3 [39 | | 97 6] [8 3] 2 lo | 4 | | 17 16 ra 3 0 0 | 4] » Alpe fee Test for optimality (Try yoursel! f as in Ex, 4:) We find that the solution is optimum, Solution is Units 1 to B+ 23 SI 2t0A+6 wo 2 B48 2 2 to Ds 30 8 3 to As 17 0 3 to C+ 16 6 Total profit = ( (16x 66)= Rs. 7005 Ex. 13: Amulti-plant. company has thi manufacturing plants A, Band Cand wo markets X and Y production costat A, B and CisRs. 1,500, 1,600 and 1,700 per piece respectively. Selling pricesin X and Y are 23x ST) + (6x 80) + (8x 42) + (30x 81) + (17x 90)! Y + x 1000 1500 000, ORM CY: nerd? 3: 07]D.25 pps. 4,400 and Rs. 4,700 respectively. Demands in X and Y are 3,500 and 4600 pieces respectively. Production capacities at A, B, and C are 2000, 3000 and 4000 pieces respectively. Transportation costs are as shown in the adjacent matrix. Solve the problem so as to maximise the profit. ‘Ans: Our problem is to determine the schedule of | production which may maximise profit. The various profits per item are as shown below. Ato X= 4400—1500-1000= 1900 4700—1500—1500= 1700 Cto Y=4700— 1700-2500 = 500 To x Y A 1900 1700 2000 From B 800 100 3000 Cc 1200 500 4000 3500 3600 Thus, it becomes a maximisation transportation problem. This is a maximisation problem and is an unbalanced Transporta- tion problem also. So introducing a fictitious column Z, we have, To From x Y Zz Production A 1900 | 1700 0 2000 B 800 100 0 3000 Cc 1200 500 0 4000 Demand 3500 3600 1900 Highest value is 1900. Subtracting all values from 1900, the matrix is _X Z Production A 0 200 1900 2000 B 1100 | 1800 | 1900 3000 700 _|1400_| 1900 4000 Cc Demand 3500 3600 1900 Now this is a minimisation problem solving the problem (Try your- self), we get the solution. A to Y-2000,Bto Y-1 100, B to Z— 1900, C to X—3500, Cto Y — 1600 Total profit = (2000 x 1700) +(1 100 x 100) + (1900 x 0) + (3500 x 1200)+ (1600 x 500)= 8510000Rs. Mathematical Formulation Ex. 13: Hindustan construction company needs 3, 3, 4 and 5 million cubic feet of fill at four earthern damsites in Punjab. It can transfer the fill from three mounds A, B and C where 2, 6 and 7 million cubic feet of fill is available respectively. Costs of transporting one million cubicD.26 sites in lakhs are. feet of fill from mound pe the ea ia n isrigelon 7 tas fj icine 16 ps ANB yh? ot? 213 G fiaeasteal 7o2 Pon O)execatt Formulate the problem as LPP. s: Linear Programming formulation. eg a be the amount of fill transferred from mounds to damsites. i hen the problem is ; mee Set 102 + 1713+ 18X44 16%) + 13X29 + 12X93 + 13X94 T2xqy + 17X39 + 20X33 + 11X54 Subject to 15x1)+10X p+ 17Xj3+18X14 = 16x) + 13Xy9 + 12X95 + 13X 4 12x54 + 17X39 + 20x33 + 11X54 15x;) + 16X3) + 12x51 10x, + 13X29 + 17X33 17X13 + 12x, + 20X43 18x; 4+ 13X94 + 11X54 = allxj > EXERCISES 1. What are Transportation problems ? 2. Explain any three methods of obtaining initial feasible solution fora trans- portation problem, 3. Distinguish between feasible and basic feasible solutions, 4. Write notes on (1) North west comer Rule (2) Lowest cost entry method ? (3) Vogel’s approimation method, 3. What are unbalanced transportation problems ? How are they solved? vou OUavwL IAN 6. What do you understand by degeneracy in transportation problems? How would you solve degeneracy ? 7. Explain the MODI method of testing optimality of a solution. 8. Explain howa transportation problem is expressed in the form of an LPP. e Explain some of the areas where ‘Transportation Techniques are employed. Ans: 0, 0,-D, =6,0,-D,=2 0, 0, -D,=8,0,-D. 0, 03~D;=1,0;— Demand 6 10 15 4 Total Cost = Rs. 128 11. Determine initial basic feasible solution of the transportation prob- lem by lowest Cost entry method.D2 Supply is 9 v 7 following transportation problem. Find an initial basic feasible solution using Vogel's method to Ans: 1-A=9, 1-B=8,3-A=12 1—~D=17,4-Be17 2-C=15,4-C=2 Total cost D, Total cost = Rs. 686 Ans: F, to W, = 5; F, to Wy = 2; 2; F, to Wy = W) = 6; Fy to Wy = 12; Total cost = Rs. 743.00 ee nen tebe ; Oy to Dy-10; O, to ‘Dg-20; O, to D;~40; O, to Ds -10; Os to Dg-25; 0, to Ds-20; Total Ans: A-4=11,B-4=4 B-1=6,C-2=7 B-2=3,C-3=12 7 to W) =| VF to BasseWare - house Available Ans: od = a = "35 X to D units 75, Z to A units 65 : its 40, Z to B units 2 t 40} 120 — Y toBunits 40, its 20 ; ie ss is 30 105 ¥ to C units 80, Z to D units 20 65 60 80 95 Total cost Rs. 7300.00 ‘A manufacturer has distribution centres located at Agra, Allahabad aC and Calcutta. These centres have available 40, 20 and 40 units of his product. His retail outlets required the following number of units. A ‘A:25;B:10;C:20;D: 30; E: 15. The shipping cost per unit in rupees between each centre and outlet is given in the following table. Retail Outlets Distribution Centre A B Cc D E Agra 5S EY 4” 5D 40 Allahabad 35 0S a Calcutta Me LS Ry Determine the optimal shipping cost. [Ans: Agra to B : 10 units; Agra to C : 20 units; Agra to E : 10 units. Allahabad to A: 20 units; Calcutta to A : 5 units; Calcutta to D : 30 units, Culcutta to E : 5 units, Minimum cost Rs. 3,600] 18. Obtain an optimum B. F. S to the following degenerate T. P. To Supply ea oe oe 2 Ans: From | 2 1 3 a 1 to 3:2 units, 3 to 1: 4 units eae 5 2to2: 1 units, 3 to 3: 1 units Demand 4 1 $5 2to3:2units, Total cost =33 19. A company has 3 plants P,, P,, P; each producing 50, 100, 150 units ofa similar product. There are five ware houses W,, W2, W3, Wy and W; having demands of 100, 70, 50, 40 and 40 units respectively. The cost of selling one unit from various plants to the ware houses differs as given by the cost matrix below. a transportation schedule so that cost is minimised. WwW W. W; W, Ww. ; 2 4; 0 (Ans: Cost=(40x 20) +(10x 28 (50x 22)+(40x 45) 9940) )+(60 x 36) + (40x 25)+(60.x 35)+ 20. Find a feasible solution of the : : ‘owing unit cost matrix. transportation problem with the foll-D.29 D, D, Dy Dy Availability Ans. 0, eel w” 0) to D, — 20, 0; to D, ~ 10 ecie, 3 2.1 50 0, to D, ~ 20, O, to Dy ~20 mid 2 5 9) » i 0, to Dy ~ 10, O, to D, ~ 20 Required 20 40-30-10 21. Find the minimum cost for transportat ing transportation technique mf S, S. Sg Required ae Rtetons | 1 4 | 1 eae 0 3 | 0 oh 4 0 2 Cy 2 4 1 3 4 Cc; L4 Qc 3 ced D Available J 1 2 2 [Ans: 15 Rs.] 2. A company has three plants P;, P,P; and three ware houses W,, W), W;. The numbers of units available at the plants are 60, 70, 80 respectively and the requirements at the ware houses are 50, 80, 80 respectively. The unit costs of transportation are as follows. Find the allocation so that the total cost of transportation is minimum. Ren Wo Wy P, [8 10 2] [Ans:P,—W,:50, mei. 1B: 12 P, —W>: 10, P,— Ws: 70 ide 10% 1 P, — W,: 70, P; — Wy: 10, Cost = 1950 2. Apply VAM to the transportation problem whose mairix is given below. Find the Optimum solution Stores: Ware house 1 2 a 4 5 Availability A 9 12 9 6 0 5 B 7 3 7 2 i) tir ee a ee ee Required 4 6 4 g 2 [Ans: 80] 24. Solve the following transportation problem. To A B Cc Ans: P, 56 | P\toB-56,P,toA-31 From P, |l6 24 16] & | P,toA-—41,P,toB-46 7 i is 7 | P,toC-4l, R 1 041 Total Cost = 2744 2%. Solve the following transportation problem. 3.4 Available » qi 2 18; A—3: 2; 0 6;B-1: 35 29; Cost = 83226. Solve the fol owing transportation Pp! p. 30 the total transportatio roblem for the optimum shipp. n cost. ing plan and compute To a Be aes x From Y feud OO DO. 21. The following is Use Modi method to ol Dy S, 1 s, | 9 45 170) 3 s, {250 200 90] 4 Requirement 4 2 2 28. Solve the following. Supply the unit cost matrix of btain the optimum D, Dy _ Available Ans: ie xto A—10, zto B~50 | xto B— 30, ztoC-—30 | yto A- 80, z to D~S0| Totalcost=6390 | a transportation problem. basic feasible solution. =1,S,-D,=3 §,-D,=2,$;-D,=2 D, = A; Cost = 820 Transportation problem. DARING Ds ADiy (Ds sre bieaeat CORRE Or Toe SION] ee oy | | Gee eae oe pageateko ered |e OR alee oe See Oe lly” 3h alinntiaae Dre tees le 2 ere OME Bye rary hes cr ornare [Ans: O, to D-5; 0, to Dy~4; O, to Dy-2; 03 to Dy -1; O; to Ds —1; 04 to D,-3; 0g to Dy-2; O, to Ds — 4; Total Cost = Rs. 112.00] 29. Solve the following Transportation problem. Market Plant A B Cc D_ Available | Ans: X to A units 5, - : 2 : x 8 X to C units 3; ¥ toC > 5 4 ‘4 f 7 units 5; Y to D units 8; ba 5 i ; ; Zto B units 11. Total cost = Rs. 336 30. Solve the following Transportation problem. r, Wi W. W3 Wa S arse. 4 3 B 2 , é F; to Ws =5; F,to W, =! Required 3030 15 2 Total cost = Rs. 210DST 31, Solve ABC Available | Ans - i 21 16 MW X to C units 14, Z to A units 18 > Aaa 2% Y to B units 15, Z to B units 13 119 3) 21 6 Y to C units I Required 18 28 25 Total Cost Rs. 1137.00 32. Solve 12 3 4 Capacity [Ans: A-2: 28 air 8 OO 0 A-5:2; B-3:19 Beni i s 4 45 B-4:26; C-1:20 m6. 1) 10 _ 9 55 C=4:7; C-5:8 Required 20 28 19 33 Total cost= 606 33. A company has three factories A, B and C which supply to four ware houses situated at P,Q, Rand S. The monthly production cap- acity (tons) of A, B, and C are 120, 80 and 200 respectively. The monthly requirements (Tons) for the ware houses P, Q, R and S are 60, 50, 140 and 50 respectively. ‘The transportation cost (Rs. per ton) matrix is given below. Determine the optimum transportation distri- bution of products to ware houses to minimise the total transporta- tion cost. Factories Ware houses iP R-B:20; R-C: A Q S-C:50; T-C: 100. R Ss 34. A company has three ware houses A, B and C and four stores W, X, Warehouse B | 8 7 % 10 () Q) 8) 38, Y and Z. The warehouses have altogether a surplus of 150 units of agiven commodity as follows: A ~ 50 B-60 c-40 The four stores need the following amounts: W ~ 20 xX-70 Y-90 Z-10 Cost (in Rs.) of shipping one unit of commodity from various ware- houses to different stores is as follows. Stores Wire Matas oe eS ST a, RET) els IL Formulate the above problem using Linear Programming Model. Work out the transportation schedule by using Vogel’s method. Find the associated transportation cost. {Ans: Total transportation cost = (70 x 50) + (70x 50) + (10x 10) + (IS x 12) +(79 x 20) = 8980] Given below is a transportatin problem. Find a schedule which will maximise the total tonnge over all the three targets.36. Required 40 20 a. D. 32 T,: 150 By—Ty : 150 | Ans: B, ~ 150 B,-T2: 148 B,-T,: 149 150 | B)~T3:2 By— 7:1 150 Total Tougnue = 4498 150 3 . eae Re ioine transportation problem to maximise profit. A_B D_ Available Ans: 0 3 3 100 1-A:20; 3-B:20 nw 35 30 30 1—D230; 3—c:50 38__38 30 D 1-E:50; 2-A:20 #0 2-C:10; Max. Profit = 5130 ring the same pro- wre 3k Sia Accompany has four factories Fl, F2, F3, F4 manufactu duct. Production and raw material costs differ from factory to factory and are given in the following table in the first two rows. The transportation cost [Link] factories to sales depots S,, Sp, S3 are also given. The last two columns in the table give the sales price and the total requirement at ‘each depot. The production capacity of each factory is given in the last row. F, F, Fy Fy Sales Product cost/Unit 15.18) 145 13. Price/unit Required Raw materialcosvunit 10 9 12) 9 S; Brose 4 4 0 qT 5 ransportation aides = ie 38. cost/Unit 2 rss Sen BWSBoAG, 31 150 Production capacity 10 150 50 100 Determine the most profitable production and distribution schedule and the corresponding profit. [Ans: F, -S, : 10; F)—S, : 90; F,—Sy: 60; F. ; :90; F,—S, : 60; F;—S, :50; Fy—S, : 80; Hos 2h, F,~S;:40; Total profit= 480] ee company manufacturing air coolers has two plants located at Bombay en Calcutta with aweekly capacity of 200 units and 100 units respectively. aes eure supplies air coolers to its A show rooms situated at Madras, es i, B galore, Cochin which have a demand of 75, 100, 100 and 30 units spectively. Due to the differences in raw material cost and transportation ost, the profit per unit (in Rs) differs which is shown in in the following table Madras __Dethi : Bombay 60 60 A Cochin Calcutta 50 10 a aAssignment Problems Assignment problem is a special case of the transportation problem inwhich the objective is to assign a number of origins (or persons) to the equal number of destinations (or tasks) at a minimum cost. For example, adepartmental head may have four persons available for assignment and four jobs to fill Then his interest is to find the best assignment which will be in the best interest of the department. Let C, be the cost if the ‘i’th person is assigned the ‘j’th job, then the problem is to find an assignment (which job should be assigned to which persons) so that the total cost for performing all the jobs is mini- mum. The problems of this sort are known as assignment problems. Mathematical formulation of assignment problems The assignment problem can be stated in the form of nx n matrix called the cost ot effectiveness matrix, where C,, is the cost of assigning i® source (person) to the j'" destination (job). Effectiveness matrix Destination 1 pies! en 2 fis on Sa. a Source |... ST A asp sais Cc Boing Cc, Sa i Mathematically an assignment problem can be stated as follows. Minimise the total cost hie a Pe 2 Cx i=. j=l wd i where x = 1, if i person is assigned to the j" job. = 0, if i person is not assigned to the ji job. Subject to the conditions a Xx = i= iit 1 forj = 1, 2,...E.2 only one job is done by the ith person where which means that va ed, dy eee a (i) &) =) fori= 1,2, jai By which means that only one person should be assigned to the j* job where j= 1,2, cece ll Difference between a Transportation Problem and an Assignment Problem (1) Transportation Problem is one of the sub classes of linear pro- gramming problems in which the objective is to transport various quan- tum of a commodity that are initially stored at various origins to different destinations in such a way that the transportation cost is minimum. The Assignment Problem is a special case of transportation problem in which the objective is to assign a number of origins to the equal number of destinations at a minimum cost. (2) In Transportation Problems number of origins and number of destinations need not be equal, so that the num- ber of rows and number of columns need not be equal. In Assignment Problems the number of persons and number of tasks are equal so that number of rows and number of columns are equal. (3) Transportation Problems are said to be unbalanced if the total demand and total supply are not equal while Assignment Problems are unbalanced when the num- ber of rows are not equal to number of columns. (4) In Transportation Problems a positive quantity is allocated from a source (origin) to a des- tination. In Assignment Problems a source (job) is assigned to a destina- tion (a man) Method for solving an Assignment Problem (Assignment algorithm) (Hungarian Method) Step 1: Subtract the smallest element of each Tow, in the cost matrix. from every element of that row. : Step 2: Subtract the smallest element of each column, in the reduced matrix, from every element of that column. Step 3: (@) Starting with row 1 of the matrix obtained, examine all rows havingexactly one zero element. Enclose this zero within Coshow- ing that assignment is made there. Cross out all other zeros in the column (in which we mark (1) to show that they cannot be used to ee Sou make ae assignments. Proceed in this way unit] the last row isE.3 ) Examine all columns with one unmarked zero. Mark ((—) at this zero and cross all zeros of the row in which [jis marked. Proceed in this way until the last column is examined. ro} Continue these operations (a) and (b) successively until we reach any of the following two situations. (i) all the zeros are enclosed by (or crossed, or (ii) the remaining, unmarked zeros lie at least two rows or columns. In case (i), we have a maximal assignment and in case (ii) still we have some zeros to be treated for which we use the trial and error method. After the above operations, there arise two situations: (i) Ithas an assignment in every row and every column so that we got the solution. (ii) Itdoes not contain assignment in all rows and all columns. In the second situation the following procedure may be followed. Step 4: Draw the minimum number of horizontal and vertical lines nec- essary to cover all zeros at least once. For this the following method is adopted. @ Mark (v ) all rows for which assignments have not been made. @ Mark (v ) columns which have zeros in marked rows. (ii) Mark (v ) rows (not already marked) which have assignment in marked columns. (iv) Repeat step (ii) and (iii) until the chain of marking ends. (¥) Draw lines through unmarked rows and through marked columns to cover all the zeros. This procedure will yield the minimum number of lines that will pass through all zeros. Step 5: Select the smallest of the elements that is not covered by lines. Subtract it from all the elements that do not have a line through them, add it to every element that lies at the intersection of two lines and leave the remaining elements of the matrix unchanged. Step 6: Now re-apply the steps 3 to 5 to the modified matrix. PROBLEMS OF I TYPE Ex.1: Find the optimum solution to the following assignment prob- lem showing the cost (Rs.) for assigning workers to jobs. Job x y z A 18 17 16 ‘Workers Be ese 1814 c 19 20 2E.4 Ans: Subtracting the smallest element of every row from all the elements of that row. aOw> onyx Subtracting the smallest element of every column from all the elements that column. aOw> onunx Ml — oe ]— oe NI — OfN]R — OfN x Mark U to zero in every row, starting from first row. But by now all the rows and all the columns have zero assignment. Solution is A to z, B to y and C to x. Total cost for assignment = 16 + 13 + 19= 48Rs, Note: For zero assignment, first consider rows with only one zero, starting with the first row. Then consider all columns with only one zero, starting with the first column. When a zero of a row is assigned, all zeros of the column, in which it lies, must be crossed out. Similarly when a zero of a column is assigned, all zeros of the row, in which it lies, must be crossed ‘out. After column assignment, again rows, then columns and so on. aAwD> we ist es Ex. 2: Solve the following minimal assignment problem Man 1 2 3 4 I Aeon ah 15 BM IR Ay 2 9c: al, A ARS aS 20 21 Won lk 430) Oe. 18 Ans: Subtracting the smallest element I ofeach row from every element of - II that row. Iv Subtracting the smallest element <8eres a Starting with row 1, we mark [to the zero inthe 1 [[0] 14 9. 3 | row containing only one zero and cross out the un} 9 20 [Q) 22] zeros in the column in which it lies. The mark m)2 0 3 xX! [indicates the assignment of that zero. IV | x 2 14 (Ol Then starting with column 1, we mark (] gee eee to the zero in the column containing only ifmu9 3] 4 ‘one unmarked or uncrossed zero and cross | 9 20 [0] 22 out the zeros in the row in which this m)\23 @) 3 & assignment [is marked. V[ x 12 14 [0] Since every row and every column have one assignment, we have the complete optimal zero assignment. So the solution is Job: I Tl MM IV Maries. 2.4 —— Assign first job to first man. Second job to third man, third job to second man, fourth job to fourth man. Total cost = 12+9+25+ 14=60 Ex. 3: Consider the problem of assigning five jobs to five persons. The assignment costs are given as follows Job L M N oO Rg A 8 4 2 6 1 B 0 2 » =) 4 Person C 3 8 9 2 6 D 4 r Lowest element among those uncovered by lines is 1. Subtracting 1 from elements uncovered by lines, adding 1 to every element that lies at the intersection of two lines and then assigning zeros, two solution are possible. Solution I Solution II Lu mivev n> heey Alf 2] af[x (0) m x 2 Bi 3 3] Bias. > [Ges SEs 1] aie ee [Cea Di 4 XK Dee 4 FST) E| & q Wile? 5 4 25m (i) Atol, Bw lV, Ctolll, Dto ll, Eto V (ii) Atoll, B to IV, C to Il, Dto V, E tol. The minimum cost in both the cases = 10 MAXIMISATION IN ASSIGNMENT PROBLEMS. The objective of some assignment problems is to maximise the ef- fectiveness like maximising profit. Such problems can be converted into minimisation problems. For this, convert the effectiveness matrix to an opportunity loss matrix by subtracting each element from the highest element of the matrix. Minimisation of the resulting matrix has the ef- fect of maximisation of the original mat Ex. 10: Given below is a matrix showing the profit for different jobs done through different machines. Find an assignment programme which will maximise the total profit. Machines M, M,; My M, 4 2.2 Jy Oa) a a Is 49 BO eOhice TR Cr ar RRs ay‘ans: Sitee the given problem is a M, M, jaximisation problem. Convertitintoa J) {TY TH uinimisation problem. Por this, subtract J, | 7 14 gil the elements from the highest element J | 1514 64. Then proceed with usual procedure. J, | 10 Subtracting the smallest element of M, M, ‘each row from all the clements of that row h{ al Then subtracting the smallest clement of J, | 2 (0) each column from all the elements of that J, | 11 U1 column. Then making zero assignments. J, | [0] Solution is J) My, Jy—My, Jy—May y= My Total profit = 54 + 50+ 61 + 63 = 228 Ex. Il: A college department chairman has the problem of provid- ing instructions for the courses offered by his department at the high- est possible level of educational quality. He has arrived at the fol- owing relative ratings regarding the ability of each instructor to each of the four courses. Courses A B ¢ D 1 6 4 6 2 2 2 6 - 7 Instructors 3 2 3 4 6 4 a 1 3 4 How should he assign the instructors to courses to maximise educational quality in his deparement. Ans: AGB CRD This isa maximisation problem. Socon- 1 [1 3 1 0 Vert it into a minimisation problem. Highe 2 |5 1 2 0 estvalue is 7. So subtractevery element 3 |5 4 3 | from 7 and then minimise. Beg cGiek Aue a3. Ania Subtracting the smallest element ofevery 1 [0 2 0 0] row from all elements of that rowandthen 2/4 0 1 0 Subtracting the smallest elementofevery 3 |3 2 1 0 column from all the elements of that column. 4 [0 2 0 0 There are two solutions for the problem.Solution : Solution I A Bt 2D, pepe 1 (a2 oe ee Nie he , x 2 | 4 0 1 x 2 4 (0) 4 Be een Oy 8 |S 2 | aol econ | 9 ec all Solutions: 1) 1-A,2-B,3-D, 4-C 1-C, 2-B, 3-D, 4-A pee the cases, maximum educational quality = 6+6+6+3= 2) Ex. 12: Five different machines can do any of the five required jobs with different profits resulting from each assignment as shown below. Machines A B G D E e430! 37... 40. 28. 40 Rao 24. 270. 721 36 Job3 40 32 33 30 35 4 25 38 40 36 -36 S25) 6h e/a Sa oo. Find out maximum profit possible through optimal assignment Ans: Aaa... EB This is a maximisation problem. Sowe 1[32 25 22 34 22 haye to convert it into a minimimisation 2|22 38 35 41 26 problem. For this, prepare an opportun- 3) 22 30 29 32 27 ity loss matrix. Highest of the elements 4|37 24 22 26 26 is 62 so subtract all elements from 62. 5|33 0 21 28 23 Subtracting the smallest element of each row from every element of that row and subtracting the smallest element of each column from every element of that co- Jumn and then making zero assignment. URYN= ‘Now the assignment is not complete. So draw minimum number of lines after marking v against the relevant rows and columns, when