Transportation Problem 1. Production costs at factories F, Fz, Fy and F; are Rs. 2, 3, 1 and 5 respectively. The production capacities are 50, 70, 40 and 50 units respectively. Four stores S,, 52,3 and S, have requirements of 25, 35, 105 and 20 units respectively. Using transportation cost matrix find the transportation plan that is optimal considering the production costs also. Stores SS Sy Sy FRoo2 4 6 Factory F, 10 8 7 5 Fo 2 3 9 42 Roo4 6 8 3 Solution: Stores SS, Sz; Sy Supply FL 242 42-62 144250 Factory F, 10+3 83 743 54370 F, 1341 +1 941 124140 F445 645 81534550 Demand 2535 105-20 Total demand = 25 + 35 + 105 + 20 = 185 Total supply = 50 +70 +40 +50 = 210 Total demand # Total supply. Therefore the problem is unbalanced. Since the total supply is more than the total demand add an extra column with zero entries and demand as the difference between their sums to make the problem balanced one. 4 6 8 B 0 50 13 1 10 8 0 70 14 4 10 3 0 40 9 1 13 8 0 50 25 35 105) 20 25 Vogel's approximation method:-50/25/0 (4) Aaya) (5) 4s, 70/45 a 10 (8)A(2)/(2)/(2) 40/5 4 10 (4)/(6)/(3)/13) +0 20 50/30 (8)/(1/(a/(5) u B 25/0 35/0 105/80 20/0 25/0 6) 02) (20) (00) ) Minimum cost = 25 x 4+ 25x 8 +45 x 104+ 25x 0+35x4+5x10+30x13 +20 x 8 = 1490 The number of basic cells = 8 = number of rows +number of columns ~ 1. Therefore the solution is non degeneracy. Modi method: For basic cells u; + uj — cy = 0 25 25 uy =0 4 6 8 B 0 45 25 wu, =2 B u 10 8 0 35 5 ws =2 4 4 10 B 0 € +0 20 my =5 9 Fry B 8 o v=4 a2 v3 =8 v5 = —2 For non basic cellsuy +2 Cz = OF2—6 0+3-13 0-2-0 Uz +) — ey = 244-13 =-7<0 uy + ¥) — Gy =2+2-11=-7<0 Uz + V4 C4 =24+3-8=-3<0 +4-14=-8<0 uy + 4 = C4 uy +5 a5 Ug + ¥y — C31 Us + ¥4 — C4 = 243-13 =-8<0 us $05 — 35 =2-2-0=0 uy $y oy =S+4-9=0 Uy + 02 — Cy = 542-11 =-4<0 Uy + V5 — ys =5-2-0=3>0 25 25 4 6 8 B 45 B a 35 5 14 4 30 9 cy w= Put ¢ = 25, we get um =0 ue us uy = 525 25 uy =0 4 6 8 3 0 70 uy =2 B u 10 8 0 35 5 us =2 14 4 10 13 0 5 20 25 mas 9 a B 8 0 wat a2 For non basic cells, uy +2 = Cyz = OF2—6 Uy + 14 — C4 = 043-13 uy +05 — G5 =0-5-0= uy +0, = Cy = 244-13 =-7<0 uy + ¥) — 2 =2+2-11=-7<0 Uz + 14 — Cy =24+3-B=-3<0 Uz + V5 — C5 =2-5-0=-3<0 Us +0, Cy, = 244-14 =-8 <0 Us + U4 — C54 =2$3-13=-8<0 Us + 5-5 =2-2-0=0 Ug tM - Cy =5+4-9=0 Uy + 02 — Cy = 542-11 =-4<0 Since uj + vj — 'y $0, Vi, j. Optimum solution is reached. 25x 4+25x8+70X104+35xX44+5xX10+5X13+20x8 +25x0=1415 2. Find the minimum cost distribution plan to satisfy demand for cement at three construction Minimum cos! sites from available capacities at the three cement plants given the following transportation costs (in Rs) per ton of cement moved from plants to sites.From Demand (tons/month) Solution: Total demand = 400 + 500 + 800 Stores 1 2 3 300 360 425 390 340 «310 255-295 275 400 S00 800 1700 Total capacity = 600 + 300 + 1000 = 1900 Total demand # Total capacity. Therefore the problem is unbalanced. Capacity {tons/month) 600 300 1000 Since the total capacity is more than the total demand add an extra column with zero entries and demand as the difference between their sums to make the problem balanced one. —|----_ 600/200/0 (300) (60)(65) 300/100 —_{310}(30)(30) 100/700 _(255)(20) (20) 300 360 4250] 600 390 340 310 0 300 255 295 275 0 1000 400 500, 800 200 Vogel's approximation method: wo J) [200 | 300 360 425 | | 10] | 200], (320 340 10 | 300 700 | ass 235 | 100 «800 s00 = 200 0 300 0 0 (45) (45) (35) (0) (45) (35)Minimum cost The number of basic cells = 400 x 300 + 200 x 360 + 100 x 310 + 200 x 0 + 300 x 295 + 700 x 275 = 504000 number of rows +number of columns ~ 1. Therefore the solution is non degeneracy. Modi method: For basic cells u; + v; 400 200 300 360 425 0 100 200 uz = -30 390 340 310 0 300 700 0 = cs 255 295 275, ° vy = 300 2 = 360 vy = 340 = 30 For non basic cells Uy + 03 — G43 = 0 + 340 — 425 = -85 <0 +, — Cy =0+30-0=30>0 Uz + ¥ — C1 = =30 + 300 — 390 = -120 <0 Ug + Yq — Crp = -30 + 360 - 340 = -10 <0 Ug + v1) C3, = —65 + 300 - 255 = -20 <0 Uz + 14 — Cay = —65 + 30-0 = -35 <0 400 200 -€ € on - 9 300 360 425 0 100 +e || 200- o 390 340 1310 0 300+! 700 —'e Cs 255 295 275 0Put € = 200, we get 400 0 200 300 360 425 0 300 uz = -30 390 340 310 0 500 500 4 =-§ 255 295 275 0 %=300 y= 360 v3 = 340 For non basic cells uy +73 — C3 = 0+ 340 — 425 uz + Vy — Cy = -30 + 300 = 390 = -120 <0 Uz + V2 — Cg = -30 + 360 — 340 = -10 <0 Uz + ¥4 — C4 = =30 40-0 = -30 <0 ug + Y, = C3, = 65 + 300 = 255 = -20 <0 Us + U4 = C4 = 65 40-0 =-65 <0 Since u; + vj — cy < 0,Vi,j, Optimum solution is reached. Minimum cost = 400 x 300 + 0 x 360 + 200 x 0 + 300 x 310 + 500 x 295 + 500 x 275 498000 3. A dairy firm has three plants located in a state. The daily production at each plant is as. follow: Plant :6 million litres, Plant 2: 1 million litre and plant 3: 10 million litres. Each day, the firm must fulfill the needs of its four distribution centers. Minimum requirement at each center is as follows. Distribution center 1: 7 million litres, Distribution center 2: 5 million litres, Distribution center 3: 3 million litres, and Distribution center 4: 2 million litres. Cost in hundreds of rupees of shipping one million litre from each plant to each distribution centre is given in the following table:Plant. Distribution Center Dy, Ds Dy 3 u 7 0 6 1 8 15 9 Determine an optimal solution to minimize the total cost. Solution: Plant Requirement 1 5 7 Distribution Center Capacity Dp Dy 3 a 7 6 0 6 4 1 a 4s 8 10 s TRI’ Since the sum of capacities is equal to the sum of requirements then the problem is balanced. Vogel's approximation method: 6 3 1 5 8 4s 9 7 5 3 2 6 0 1 (3) (5) (1) (st (4) (2) (3) 6/1/0 (1) (5) 1o — (1)(0) 10 (3)(4)Minimum cos 1X245X341X146X543X15+1x9 = 102 The number of basic cells = 6 = number of rows +number of columns — 1. Therefore the solution is non degeneracy. Modi method: For basic cells u + vj — 1 5 uy 2 3 u 7 1 w= -5 1 0 6 1 6 3 1 5 8 15 9 % vy=12 4 =6 For non basic cells, wy 3G #12-11 >0 ty tm — Gy =04+6-7=-1<0 ty + ¥p— ey =-S+2-1=-4<0 uy #2 — C2 = -S+3-0=-2<0 Ug +03 — C23 = 5+12-6=1>0 Uy + ¥; — ez =3+3-B8=-2<0Js ‘ 9 0 2 3 n 7 1 1 0 Ls 1 b+e 3-€ 1 oO 5 8 15 3 Put e = 1, we get 5 1 2 3 u 7 1 1 0 6 1 . 7 2 1 5 8 15 9 vad m=3 | wall 4=5 For non basic cells uy $v, ec = 04F1- uy + %— 4 =045— uy + vy ~ en = 43-0 =-1<0 wy + 3-03 =—44 11-6 =1>0 ug + vy —cy = 3+4-8=-1<0Put e = 1, we get 5 1 uy 2 3 1 7 1 y= -5 1 ° 6 1 7 1 2 us 5 8 15 9 ye p11 =5 For non basic cells, wy $Y) en uy tm — cy =04+5-7=-2<0 Ug $Y, - en = =-2<0 uy +2 — C2 = SB - Un +4 — Gy = -S+5—-1=-1<0 Us + v2 cy = 3+4-B8=-1<0 Since u; + vj — cy $ 0,Vi,j. Optimum solution is reached. Minimum cost = 5x 3+1X11+1X6+7x5+1x15+2x9 = 1004. A company has factories at F;, F, and Fs which supply to warehouses at W;, W, and Ws. Weekly factory capacities are 200, 160 and 90 units, respectively. Weekly warehouse requirement are 180, 120 and 150 units, respectively. Unit shipping costs (in rupees) are as follows: A We Ws A 16 20 2 Factories F, 4 8 18 Fy 26 24 16 Determine optimal distribution for this company to minimize total shipping cost. Solution: W, W, Wy Capacities F te | 20 | 12 200 F; | 3 | 18 160 Fy 26 | 24 | 46 90 Requirement 180 120 150 Since the sum of capacities is equal to the sum of requirements then the problem is balanced. Vogel's approximation method: \ { 140 | «| i | 200/140 (4) (4) 16 | 20 i 7 20 |) i i i 160/40 (614) u i 3 18 | #2 |) | | 90/0 (8) (10) 26 | 2 16 180 120/ 0 150/ 60/0 (22) (12) (ay/ (6)Minimum cost = 140 x 16 + 60 x 12 + 40 x 14 + 120 x 8 + 90 x 16 = 5920 = number of rows +number of columns ~ 1 The number of basic cells = Therefore the solution is non degeneracy. Modi method: For basic cells u; + v; 140) 60 uy 16 20 2 40 120 uy =-2 4 8 18 90 wy a4 6 24 16 v= 16 yy =10 w= 12 For non basic cells uy + v2 — C2 = 0410-20 = -10<0 Uy + Vy — G3 = -2 412-18 =-8 <0 us +; C3 = 4+ 16-26 = -6 <0 Us + V2 - C2 =4+10-24=-10<0 Since u; + — cy < 0, Vi, j. Optimum solution is reached. Minimum cost = 140 x 16 + 60 x 12 + 40 x 14 + 120 x 8 + 90 x 16 = 5920 5, Solve the transportation problem using Vogel's approximation method and check its optimality using MODI method, From To Availability A BoC 1 50 30-220 1 1 90 45 170 mM 250 200 50 4 Requirements 4 2 2 Solution: Since the sum of Availability is equal to the sum of requirements the problem is balanced.Vogel's approximation method: | 1 (20) (20) 50 30 220 3 (45) (45) 90 45 170 = a/2/0 (150) (50) 4 2 2 o 0 (40) (a5) (120) Minimum cost = 1 x 50 + 3 x 90 + 2 x 200 + 2 x 50 = 820 The number of basic cells = < number of rows +number of columns ~ 1 Therefore degeneracy occurs. To make the solution has non degeneracy select the minimum value in the non basic cell and make it as basic cell with 0 value entered in the box. 1 0 1 50 30 220 3 3 90 45, 170 2 2 4 250 200 50 4 2 2 The number of basic cells = 5 «number of rows number of columns — 1 Therefore the solution is non degeneracy. Modi method:For basic cells u, + ¥ 50 30 220 3 u, = 40 90 4s 170 2 2 uy = 170 250 200 50 v= 50 », = 30 v3 = -120 For non basic cells, u; + V3 — C3 = 0 - 120 — 220 = -340 <0 Uz + ¥2 =e = 40 +3045 = 25 >0 Uz + V4 — C73 = 40 — 120-170 = -250 <0 us + ¥ — C1 = 170 + 50 — 250 = -30 <0 ise] [one a= 1 30 220 45 170 2 2 250 200 50 Put € = 0, we get1 50 30 220 3 0 uz = 40 90 45 170 2 2 us = 195 250 200 50 vy, =50 v3 = -145 For non basic cells Uy + V2 — Cy = 045-30 =-25>0 uy +03 — 3 = 0-145 — 220 = -365 <0 Uz + v3 — ¢23 = 40 — 145 = 170 =-275 <0 us + v; —¢3; = 195 + 50-250 =-5 <0 iy <0, Vi, j. Optimum solution is reached Since uj + vj — Minimum cost = 1x 50 +3 x 90 +0x 45 +2x 200 +2 x50 = 820 6. Consider the following transportation problem: Factory Godowns 23 4 5 6 Stock Available A 7577 5 3 60 B l6 u - 5 20 c 116 22 8 90 D 49 109 6 9 212 50 Demand 60 20 40 20 40 40 It is not possible to transport any quantity from factory B to godown 5. Determine: {i) Initial solution by Vogel’s Approximation method. (ii) Optimal basic feasible solution. {iil) Is the optimal solution unique? If not find the alternative optimum basic feasible solution. Solution: Since the total stock availability is equal to the total demand, the problem is balanced.Vogel's approximation method: 60/40 J0 (2) A2yA2) 14) 20/10 (ay(Uy/(ayay/(3) 90/70/30 /0 (Oy/(OV/(4)A2)/(5) 1 1 T 1} 50 ' i L 1 ' | 50 1 ' 9 9 fe] fo] aj] evavovone | ' 60 20/0 40/0 40/0 40/10/0 2/0) 6) ) 8) 2) 0V/0) 0) go The number of basic cells = 8 < number of rows +number of columns ~ 1 Therefore degeneracy occurs. To make the solution has non degeneracy select the minimum value in the non basic cell and make it as basic cell with 0 value entered in the box. 20 0 40 60 7 5 7 7 5 3 10 10 20 9 un 6 uw ~ 5 30. 20. 40 90 n 10 6 2 2 8 50 50 9 10 9 6 9 2 60 20 40 20 40 40Minimum cost = 20x 5 +05 +40 x3+10x9 +10 x 6+ 30x 6 +20%2 +40x2+50x9= 1120 Modi method 20 0 40 7 5 7 7 5 3 10 10 w= 8 u 6 Ft © 5 30 20 40 " 10 6 2 2 8 50 9 10 9 6 9 2 My =12 %=5 y=9 HHS % For non basic cells, uy +c; =0+12-7=5>0 Uy +05 C43 =049-7=2>0 uy +4 - Cy =045-7=-2<0 Uy #2 =e ==345-11=-9<0 Uz + U4 — C4 = -3 45-11 =-9<0 Ug +05 — G5 = -3 +5 - w= -w <0 Uz + ¥6 — C6 = -3 43-5 =-5 <0 Us + Y= 6 =-3 412-11 =-2<0 Us + ¥2 — Cy =-3+5-10=-8 <0 Ug + V6 — C35 = -3 +3-B =-8<0 Uy + V2 — Cg = -3+5-10=-8 <0 Uy + ¥3 — C3 = -3 49-9 =-3 <0 Uy + V4 — Cy =-3 45-6 =-4<0 Uy + V5 — C5 =-3 45-9 =-7<0 Uy + V6 — Cg = 343-12 =-12<02 [20 0 ts 7 7 s| 3 oT. oI o| ule ul fo] os 30 wo] [x ul | of Ee 0 9 w} 5 o| \2 Pute =0 0 2 os 7 A s| 3 0 0 of ul 6 ul eos PTC % 3 w} 8 5 o| 2 For non basic cells dy +3 cy = OF4—7 Uy $Y — Cy =OF0-7 uy +5 — C5 =O+0—5 +5-11=-4<0 40-11 Uy + Ys — C5 = 240-00 = Uy + U6 — C5 = 243-5 = Uz + V2 ~ Cop Uz + V4 - Cog wy uy =2 us =2uy + ¥,- cy =2+7-11=-2<0 +5-10=-3<0 Us + ¥6 — Cag = 2+3-8=-3<0 Uy + ¥2 — C42 =2+5-10=-3<0 Uy + 05 4g = 244-9 = Ug + 14 = C44 = 240-6 = Uz + V2 — C32 uy + V5 — Cys = 240-9 = uy +5 — Cys = 243-12 Since w + vj — cy < 0,Vi,j. Optimum solution is reached. Ox7+20x5+40xX3+410xX9+10X64+30xX6420x2 +40x2+50x9= 1120 Minimum cost 7. The Burgarf Co. distributes its products from 2 ware houses to 5 major metropolitan areas. Next months anticipated demand exceeds the warehouse supplies and the management of Burgraf would like to know how to distribute their product in order to maximize the revenue. Their distribution costs per unit are shown in the table. To be competitive Burgraf must charge a different price in different cities. Selling prices are Rs. 9.95, Rs. 10.5, Rs. 9.5, Rs. 11.15, Rs. 10.19 in cities 1, 2, 3, 4and 5. From Warehouse 1 2 3 4 5 Supply 1 15 165 205 14 135 800 2 16 21 18 165 2 1000 Demand 500 200 300 600 800 Find the optimal allocation to maximize the revenue. Solution: From Warehouse 1 2 3 4 5 Supply 1 9.95-15 105-165 95-205 1115-14 1019-135 800 2 995-16 105-21 95-18 1115-165 1019-2 1000 Demand 500 200 300 600 800 Total demand = 500 + 200 + 300 + 600 + 800 = 2400 Total supply = 800 + 1000 = 1800 Total demand # Total supply. Therefore the problem is unbalanced.Since the total supply is less than the total demand add an extra row with zero entries and demand as the difference between their sums to make the problem balanced one. 8.45 8.85 7.45 9.75 8.84 8.35 84 77 95 8.19 0 0 0 0 0 500 200 300 600 800 800 1000 600 Convert the maximization problem into a minimization problem by subtracting all the values from the highest value. 7 a_i ! —t- -+ 13 23 of oat! 28 ‘on \ -- ! iq 14 2.05 10.25 156! 2 20 ' i i 9.75 9.75 19.75 9751 1 1 | ! 500/300 300 600/0 200 (0.1) (0.45) (0.25) (0.25) (0) (8.35) (8.4) (7.7) 500" (0.9)/(0.01) 1900 /400/200/0 (2.1) (0.05) H0.051/(0.65) 600 (0) Ao) Ho)0 00 13 09 23 ° ost 200 200 600 14 1.35 2.05 0.25 1.56 aon ann 9.75 9.75 975 9.75 9.75 yal mell wy=11IS %=0 ys =0.91 For non basic cells, uy +; Cy = 115+0-13 ==0.15 <0 uy +2 — Cz =0+11-09=02>0 uy + 05 — 43 = 04 1.15 —2.3 =-115 <0 Uz + ¥5 — C3 = 0.25 + 1.15 — 2.05 =-0.65 <0 ty + ¥5 = 5 = 0.254091 - 156 =-04 <0 Us + ¥2 — C32 = 8.6 + 1.1- 9.75 = -0.05 <0 Us + 14 — C34 = 8.64 0- 9.75 = -1.15 <0 Us + ¥6 — Cy = 8.6 + 0.91 9,75 = 0.24. <0 € 800 yo 4 13 os | | 0.91 t r 200 200 | -¢! 600 | te L a 14 1.35 2.05 0.25 1.56 300 300 9.75 9.75 9.75 9.75 9.75 Pute =0 ay = 0.25 us = 8.64 00 13 09 23 0 091 200 200 600 ay = 045: 14 1.35 2.05 0.28 1.56 300 300 uy = 88 9.75 975 9.75 975 9.75 %=095 %=09 4=095 y v5 = 0.91 For non basic cells, uy $Y, — C4 = 040.95 -13 35<0 Uy + ¥3 — C13 = 0+ 0.95 - 2.3 =-1.35 <0 Uy +4 — C44 =0-0.2-0=-02<0 Uz + ¥5 — C3 = 0.45 + 0.95 — 2.05 = -0.65 <0 Uz + V5 = 5 = 0.45 40.91 - 156 =-02 <0 Us + ¥2 — C32 = BB + 0.9- 9.75 = -0.05 <0 Us + V4 — C34 = 8.8 = 0.2 - 9,75 = -1.15 <0 Us + U6 — Cas = BB + 0.91 — 9.75 = -0.04 <0 Since w + vj — cy < 0,Vi,j. Optimum solution is reached 0 800 800 8.45 8.85 7.45 9.75 8.84 200 200 600 1000 835 a4 7 95 8.19 300 300 600 0 o 0 o ° 500 200 300 600 800 Maximum cost = 0 x 8.85 + 800 x 8.84 + 200 x 8.35 + 200 x 8.4 + 600 x 9.5 +300 x 0 + 300 x 0 = 16122Assignment Problem 1. At the end of a cycle schedule a trucking firm has a surplus of one variable in each of the cities 1, 2, 3, 4 and 5 and a deficit of one vehicle on each of the cities A, B, C, D, E and F. The costs in rupees of transportation and handling between the cities are given below. Find the assignment of surplus, vehicles to deficit cities which results in minimum total cost. Also find cout which city will not receive a vehicle? Solution: wewne AB ¢ 134 «116 «167 114195260 129 «11748 71 «156 92 97 134125 233 166 94 143 E F 194197 175 130 66 = 101 114136 1425 Since the number of rows is less than the number of column, the problem is unbalanced. To make it balance (i.e., number of rows =number of columns) add a row with zero entries. A BOC 1 134 116 167 2 [114 195 260 3 [129 117 48 4| 71 156 92 5 \97 134 125 6 \o 0 0 Row reduction A BOG 1 fg fo) 41 2 {[o] 81 1h6 3 [ai a7 [p 4 [M85 71 5 \14 st 42 6 eee Do:E 233 194 166 175 94 66 143 9114 83 1425 0 0 DOE 117-78 $2 61 46 18 q2 43 Db] 1342 K-fo FP 197 130 101 136 118 81) 16 53 65 35 K Number of lines drawn # Number of rows. Optimality condition is not satisfied.AB CD, 1 np fe] st up 2 (Kk a 146 sd 3 [ah 17 [Lo] 4¢ 4 {[d] a 2 74 s \ie a 42 [ol 6 Mtb —ao-—s6-—44. Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied, Minimum cost = 19 B,29F,39C,454,55D,6>9E 16+ 130+ 48+71+83+0= 448 2. A company is faced with the problem of assigning 4 machines to different jobs (one machine to one job only). The profits are estimated as follows. Solve the problem to maximize the total profits. Solution: Job Machine ourone wuaw~voul> Nua owrale onxwuasaniloa a wiervalo Since the number of rows is more than the number of columns, the problem is unbalanced. To make it balance (i.e., number of rows =number of columns) add two columns with zero entries. AB canes c ReVevas F Converting maximization problem into a minimization problem by subtracting each value of the row from its highest element in the row.ouwcac® Beawwa sd wreccet Column reduction: Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied. 156,234,3>B,4>D,5>F,69C Maximum cost =0+7+8+7+0+6=28 3. A computer centre has three expert programmers. The head of the centre wants to allocate projects to programmers. The development time in hours is given in the table below. Allocate the projects to the programmers, in-order to minimize the development time. Projects Programmers 1 2 3 A [120 100 8 | 80 90 110 c 110 «140120 Solution:10203 A 120 100 80 B (s 90 x) c \110 140 120, Since the number of rows is equal to the number of columns, the problem is balanced. Row reduction: 123 A (40 20 0 B (0 10 30 c \o 30 10 Column reduction: 123 A 74010 BK -fot-30) c 2046+ Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied. A>3,B92,03A Maximum cost = 80 +90 + 110 = 280 4. A department has five employees with five jobs to be performed. The time (in hours) each mean will take to perform each job is given in the effectiveness matrix. Employees bom om owioy 10 5 13 15 16 309 B 3 6 woo7 2 2 2 7 WM 9 7 BR 7 9 0 4 WD Jobs mooear Solution: Since the number of rows is equal to the number of columns, the problem is balanced. Row reduction:“iw v I $ [oJ $7 wu 3 mone an dofs] axle Number of lines drawn # Number of rows. Optimality condition is not satisfied. Tou Vv (ae & 9 B 1 ¢ |b D ae 3 E\d § 6 Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied. ASILB LC 3V,D3 ULE WV Minimum cost = 5+3+2+9+4=23 5. Solve the assignment problem. 18 13 38 19 Machine goe>p Solution: Since the number of rows is equal to the number of columns, the problem is balanced. Row reduction: 26 28 19 26 7 14 18 24 cE 26 15 10PQRes A /7 15 6 0 B{o 18 1 43 c \23 4 3 0 p \9 16 14 0 Column reduction: bom come vob Number of lines drawn = Number of rows. Therefore Optimality con ARBOP,C3Q,D 9S Minimum cost = 17 + 13+ 19+10=59 ion is satisfied.6. A company has five jobs to be done. The following matrix shows the return in rupees of assigning i‘* machine (i = 1,2,3,4,5) to the j** job (j = A,B,C, D, E). Assign the five jobs to the five machines to maximize profit. A B C DE 15 ll 10 2 4 22 4 6 3 5 303 12 #5 4 6 4 6 @ 4 UW 7 5 7 9 8 2 5 Solution: Since the number of rows is equal to the number of columns, the problem is balanced. Row reduction: AB CDE 1/1 768 0 2/0241 3 3 fo 9 213 4\2 007 3 5 \2 43 7 0 Column reduction: ae o~ Ble & fe SRN keep Bln Ep Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied. 19 £,29D,394496598Minimum cost = 4+3+3+44+9=23 Travelling Salesman Problem 1. A delivery truck must leave a warehouse and visit four customer delivery points and return to the warehouse. Find out the best route where (1 represents the warehouse). Distance (Miles) To 1 2 3 4 5 a - wm 7 5 5 2 Mm - 4 6 8 From 3 7 4 - 7 8 4 5 5 7 - 3 5 3 8 83 - Solution: 12345 t/o 07 5 5 2{11 » 4 6 8 3/7 407 8 4\5 5 7 » 3 5\3 8 8 3 @, Row reduction 4234 65 1 /> 5 2 fi) 2(7 o [0] 4 4 3/3 ole 44 a\2 2 4 o Gy 5 55 Ko Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied, 1943555123352 Minimum cost =5+3+3+4+4=19 12and34=5+3=8 13and24=2+2=4 42and35=2+4=6 43and25=4+4=852and31=S+3=8 53and21=5+7=12 Since 13 and 24 give the minimum extra amount we select this route. 13332345551 Minimum cost = 7+44+6+34+3=23 2. A salesman has to travel five cities in a month without revisiting any city. Determine an optimal travel plan for the time matrix (in hours) given. Tocity A B Cc D € A 4 7 3 4 From City Bl) 4 - 6 3 4 cl7 6 - 7 5] Di 3 3° 7 - 7 ela 4 5 ABCD E Ajo 4 7 3 4 Bl 4 © 6 3 4 cl7 6» 7 5 D\3 3.7 » 7 E\4 4.5 7 o, Row reduction: ABCD & Ajo 14 0 1 Bi(1 © 3 0 1 cl2 1020 D\o 0 4 » 4 E\o0 0 1 3 Column reduction:races a/b 1 (gt Ai. Og EX D4 Number of lines drawn = Number of rows. Therefore Optimality condition is satisfied. A+B3D3A,C ESC Minimum cost =4+3+3+5+5=20 AC and EB =2+0=2 AE and CB=1+0 BC and ED =1+4=5 BE and CD =1+2=3 DC and EA =3+0=3 DE andCA=5+1 Since AE and CB give the minimum extra amount we select this route, A>E9C3B>D>A Minimum cost =4+5+6+3+3=21