Reagjloltead RIM|Nagpur, University BCA Part-II (3° Semester) il’ Solved Series THAKUR PUBLICATION NAGPUROPERATIONS RESEARCH-I TP SOLVED SERIES For BCA [Bachelor of Computer Applications] Part-II, Third Semester Students of ‘Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU)’ Edition 2019 Reprint Edition 2020 Copy right © Aut Rights Reserved This book is sole subject to the condition that it shall not, by way of trade or otherwise, be lent, resold, hited out, or cthenvise circulated without the publisher's prior written consent, in any form of binding or cover, other than that in which itis published and without including a similar condition. This condition being imposed on the subsequent purchaser and ‘without limiting the rights under copyright reserved above, no part of this publication may be reproduced, stored in or transmitted in any form or by any means (electronic, mecha jotocopying, recording or otherwis ‘ritten permission of both the copyright owner and the below mentioned publisher of this book. ithout the prior Books are Available for Online Purchase at: www.tpplorg.in THAKUR PUBLICATION PVT. LTD., NAGPUR + Lucknow + Meerut * Hyderabad * Pune * Jaipur * Chennai * Rohtak * + Jalandhar * Ahmedabad * Bengaluru * Bhubaneswar * Bhopal * Kerala * Kolkats Plot No. 109, Nawa Nakash, Behind Jaiswal Restaurant, Near Choti Maszid, Nagpur-440017. Mob. 09595029116, 8840084584, 9 318594 / 22.Syllabus UNIT-1 jon to Operation Researc! felopment of Nature of OR, Characteristics of OR, Introduction to Operation Research (OR) Origin and development of OR, Nature emcieslicerot OR Classification of Problems in OR, Models in OR, Phases of OR, Uses and Limitations of OR, Met Applications in OR. Linear Programming ~ Concepts of Linear Programming Model. Mathematical Formulation of the Problem, Graphical solution methods. UNIT - IL Linear Programming Methods ~ Simplex Methods, Big M methods, Dual Simplex Mettiod, TwoPhase methods, Duality in Linear Programming ~ Formulation of Dual Problem, Application of Duality UNIT - TH ‘Transporation Problem ‘Mathematical model for Transportation Problem, Types of Transportation Problem UNIT- IV Assignment Problem ~ Zero-One Programming Model for Assignment Problem, ‘Types of Assignment Problem, Hungarian Method, Branch and Bound Technique for Assignment Problem. Retailers / Distributors NAGPUR 1. Book World, Swami Samarth Complex, Opp. Home Mahila Sobhagruh 282, North Bazsar Road, Gokul Peth, Nagpur-#40010. Ph, 0712-2562999, Mob, 9422864426, 2. Central Book Shop, Near Jhanshi Rani Chowk, Nagpur. Mob. 09823073909 3. Laxmi Pustakalaya and Stationers, Kelibagh Road, Mahal, Naypur-4400032, Ph, 0712-2720379, 2727354 4. Pragati Book Depot, Near Rajvilas Talkies, Mahal, Nagpur. Ph. 2721354, Mob. 9823030242 5. Renuka Book Depot, Near Rajvilas Talkies, Mahal, Nagpur. Mob. 0976540613 6. Venus Book Centre, Opp. Rajaram Library, Ram Nagar Road, Mangalam Arcade, Dharmpeth Extn., Nagpur. Ph. 2520781, 2536314 7. Vijay Book Depot, 477, Gola Chakka Marg, Near Karachi Jeneral Store, Nagpur. Mob. 9122534217 WARDHA. & Gandhi Book Depot, Arui Naka Square, Near Sai Mandir Wardha. Mob, 8275285568, 9420682100, 07840979193, GONDIA 9. Shree Mahavir Book Depot, Pal Chowk Rail Toli, Gondia-441601. Ph. 07182-225032‘Transportation Problems (Unit 3) bss UNIT 3 TRANSPORTATION PROBLEMS Ques 1) What is transportation problem? What are the features of transportation problem? Or What are the main characteristics of a transportation problem? (Dee 2016 (2¥)) Ans: Transportation Problem “Transportation model is defined as the study of optimal transportation and resource allocation, Transportation model is defined a8 the distribution of goods from many points of supply to a number of points of demand, where the points of supply are known as origins or sources and points of demand are known as destinations or sinks. It is also involves in determination of the minimum cost to allocate toa product from several supply sources to several destinations “The transportation problem is to transport different amounts of a single homogenous product, which are initially kept at various origins, to different destinations with the objective of minimising the total transportation cost. For example, let us consider a cold drink manufacturing company has four plants which are situated in four different cities. Shops which are located in four different cities consume the total production of these four plants. Here in this example, supply and demand of cold drinks lead to a transportation problem as we need to find a transportation schedule that minimises the total cost of transporting cold drinks from different plant locations to various shops. ‘Transportation model isa special class of the linear programming problem (LPP). Characteristics/Features of a Transportation Problem Following are the main characteristics of a transportation problem: 1) Objective function is to reduce the transportation cost to the minimum 2) Maximum quantity available at the sources is limited. This is @ constraint. 3) Maximum quantity required at the destination is specified. This cannot be exceeded, this is another constraint. 4) Transportation cost is specified for each item. 5) Sum of the products available from all sources is equal to sum of the products distributed at various destinations Ques 2) Describe the mathematical model for transportation problem. Or Explain Mathematical model for transportation problem. (oné tes or Discuss the Matrix form of Transportation Problem. 2018124) ‘Ans: Mathematical Model for Transportation Problem Given m sources and n destinations, the supply at source i is a, and the demand at destination j is b,. The cost of shipping ne unit of goods from source i to destination jis cy. The goal is to minimise the total transportation cost while satisfying all the supply and demand restrictions. Let, a, = Quantity of commodity available at origin i, +, = Quantity of commodity required at destination j, c, = Cost of transporting one unit of commodity from source/origin to destination j jantty transported from origin ito destination ‘Then the problem is to determine the transportation schedule so as to minimise the total transportation cost satisfying supply and demand constraints” BCA, Third Semester TP Solved Series (Operations Research-1) RTMNU Mathematically, the problem may be stated as a linear programming problem a follows: Minimise Total Cost_ z=) Devs i Subject to Dey=a fori=1,2, And x20 mand j=1,2. For ease in presentation and solution, a transportation problem is generally presented as shown in transportation table below: ‘Transportation Tableau Origin (i) Destination () ‘Supply(ay) oT! @l= & f= @&. * Demand, by 5 b - % Bay= Eby Let 01, Oz, ..., Om be m plant where ay, ay, ...., ay Fespectively product is available. Let dj, do... dy be m destinations each of which have the bj, bs, .... by requirement respectively. The objective function minimises the total cost of transportation (2) between various sources and destinations. The constraint i in the first set of constraints ensures that the total units transported from the source 1 is less than or equal to its supply. The constraint j in the second set of constraints ensures that the total units transported to the destination j is greater than or equal to its demand. That is, the total capacity (or supply) must be equal to the total requirement (or demand). Example: There are three fertilizer plants A, B, and C of a Tata Chemicals in Lucknow. The production of fertilizer at every plant is as follows: Plant A: 7 million tonne Plant B: 6 million tonne Plant C: 12 million tonne The four distribution centers of company demands the following quantity from these three plants: Distribution C Distribution Centre Distribution Centre (tre X: 8 million tonne million tonne million tonne Distribution Centre W: 5 million tonneTransportation Problems (Unit 3) bs? For cach one million tonne quantity transported by every plant to each distribution centre, the costs are in hundreds of rupees as shown in table below The standard form for this transportation problem is illustrated below. Distribution Centre Fen Tx Ty [2 Tw Ata ts iste B [sto fey [7 a0 fa7 Fa} Distribution Centre Plant }———P Fi A [ane] na=5 [xo=t3 Bo |xy=3| x =2 | xa © | x7] x32= 10] x99= 17 cry Demand] 8 | 8 4 4 2s Each cell of table x11, xs supply and demand respectively Ques 3) Discuss the transportation problems, assumptions used in Ans: Assumptions in Transportation Problem 1) The total requirement at different destinations is equal to the available quantity of the item at various sources. The items can be transported easily from all sources: to destinations. 3) The cost of the product for unit transportation from all, sources to destinations is definitely and exactly known, 4) The cost of transportation on a given route is directly proportional to the number of units transported on that route 5) To minimise the total transportation cost for the organisation as a whole and not for individual supply and distribution centres is the main objective 6) The demand of a destination can be satisfied by the use of more than one source Ques 4) What are the transportation problems? Or Explain the following terms used in transportation problem: 1) Feasible Soh Optimal Solution Non-Degenerate Basic Feasible Solution Degenerate Basic Feasible Solution ‘Ans: Basic Solutions for Transportation Problem 1) Feasible Solution: A feasible solution to a transportation problem is referred 10 a @ set of non- negative values Xj. i= To Qu j= Fe 2... that satisfies the constraints, Xu shows the transportation cost, The right column and bottom row of table illustrates the 2) Basie Feasible Solution: Basic feasible solution for a transportation problem is a feasible solution that has not more than (m+n -1) non-negative allocation Optimal Solution: An optimal solution is a feasible solution (not necessarily basic) which minimises the total transportation cost or maximises total revenue. 3) 4) Non-Degenerate Basic Feasible Solution: Non- degenerate basie feasible solution of a transportation problem is a feasible solution that has exactly (m +n = 1) allocation in independent positions Degenerate Basic Feasible Solution: A basic feasible solution which consists of less than (m +n — 1) non-negative allocation is known as degenerate basic feasible solution, 3) Ques 5) Discuss the transportation algorithm? Or What are the different transportation problem? ‘Ans: Transportation Algorithm ‘The solution algorithm to a transportation problem may be summarised into the following steps: Step 1) Formulate the Problem and Setup in the Matrix Form: The transportation problem is formulated in the similar manner as the LP problem is formulated. Here the total transportation cost is the objective function and supply and demand available at each souree and destination is taken as constraints, Step 2) Obtain an Initial Basic Feasible Solution: The following three methods are used to obtain an initial solution: 1) North-West Corner Method 2) Least Cost Method 3) Vogel's Approximation Method steps of solutions ofbse The following conditions must be satisfied by the it solution which is obtained by any of the three methods: 1) The solution must satisfy all the supply and demand ‘< which is also called rim condition ‘The number of postive allocation must be equal to m +n 1, wheie m represents the number of rows and represents the number of columns, Any solution which satisfies the above conditi termed as non-degenerate basis feasible solution and the solution whieh does not satisfy the above conditions is called degenerate solution, Step 3) Test the Initial Solution for Optimality: ‘The Modified Distribution (MODI) method is used for testing the ‘optimality of the solution obiained in step 2. Stop the Procedure if the current solution is optimal. If solution is not ‘normal then determine a new improved solution, Step 4) Updating the ‘optimal solution is reached. lution: Repeat step 3 until an Ques 6) What are the different types of transportation Problems? Ans: Types of Transportation problems ‘There are mainly four types of transportation problems: If the sum of the supplies of all the sources is equal to the sum of the demands of all the destinations, then such type of problem is known as balanced transportation problem, Mathematically, it is represented by the following rater ae Unbalanced Transportation Problems: If the su of the supplies of all the sources is not equal to the suum of the demands of all the destinations, then this kind of problem is known as unbalanced transportation problem, Mathematically, it is represented by the following relationship: 2 3) Minimisation Transportation Problems: Generally, transportation model is used for solving the cost minimisation problems. It is also used for solving the problems in which objective is to maximise total value or benefit 4) Maximisation ‘Transportation Problem: Generally, transportation model is used for solving the cost minmnisation problems. It is also used for solving the problems in which objective is to maximise total value or benefit. In this ease the unit profit or pay-off py related with each route, j) is given instead of unit cost ¢,. Then the objective function in terms of total profit or pay-off i defined as follows Maxine Ld CA, Third Semester TP Solved Series (Operations Research-1) RTMNU For solving the maximisation transportation problem, the algorithm is same as that for the minimisation problem. But few adjustments are required in Vogel's Approximation Method (VAM) and MODI optimality tests are required to find the initial solution because in this problem profits are given instead of costs. In each row oF column, by using VAM method to find initial solution, penalties are computed as difference between the largest and vext largest pay-off. In this case row and column differences represent pay-offs Allocations are made in the cells with the largest pay- off corresponding 10 the highest row or column difference In VAM method, penalties are calculated in each row or column as difference between the largest and next largest pay-off. The criterion of optimality for the maximization problem is just opposite of the rule for minimisation problem, For maximisation case the solution is called optimal ‘when all opportunity costs 4, for the unoccupied cells are zero oF negative, Ques 7) Write the different phases of solutions of transportation problems. List’ out the different methods of finding initial basic feasible solution, Ans: Phases of Solution of Transportation Problems There are two phases in which all transportation problems can be solved Phase I: Initial Basic Feasible Solution: Generally, a transportation problem consist of 'm’ and ‘n’ number of origins and destinations respectively. A feasible solution exists when the following condition satisfies: Ya=Db i.e., sum of the origin capacities must be equal to the sum Of destination requirements, In the transportation problem matrix, a feasible solution satisfies m +n — 1 number of allocations Also, the number of allocations which is equal to m+n ~ Lis same as the order of matrix (m x n) or number of basic cells. Following are some important methods which are used to determine the initial basic feasible solution: 1) North-West Method, 2) Matrix Minimum/Least Cost Method, and 3) Vogel's Approximation Method. Phase TH: Optimum Basic Feasible Solution: An optimal solution is defined as a basic feasible solution that minimises the total transportation cost. The following two methods are used to obtain an optimal solution 1) Stepping Stone Method 2) Moditied Distribution (MODI) Method“Transportation Problenys Unit) Methods of Finding Initial Ba The methods which are used problem to determine an init be summarised as follows: 1) North-West Corner (NWC) Method 2) Row Minima Method 3) Column Minima Method 4) Least Cost/ Matrix Minima Method 5) Vogel's Approximation Method (VAM) Feasible Solution Ques 8) Describe the North-West Corner method with its advantages and disadvantages, Or Explain North-West cor to solve transportation problem f . 2017105) Ans: North-West Corner (NWC) Rule/Method ‘The North-West Corner Rule is a method adopted to compute the initial feasible solution of the transportation problem. The name North-west comer is given to this method because the basic variables are selected from the extreme left corner, ‘The method can be summarised as follows: Step 1: In the transportation table, the frst allocation is done in the cell placed at the upper leftchand ie, north- ‘west comer of the :ble. The amount allocated in the first cell should be the maximum possible value i.e, x1 — min (a, by). The cell (1, 1) in the transportation table is assigned this value x11 Step 2: The allocation in step 1 is of such a magnitude that either the capacity of the origin of the first row is satisfied or the requirement of the destination of the first column is satisfied or both. In step 2, the following three conditions are evaluated on the basis of first allocation: 1) If by> a), move vertically downwards to the second row in the cell (2, 1) and make the second allocation of x21 = min (a, by ~ ay). 2) If by< @,, move horizontally right-side to the second column in the cell (1, 2) and make the second allocation of x42 = min (jt) ~ br, ba): 3) If b, = aj, then there is a tie for the second allocation, ‘The second allocation can be done in cell (2, 2) in the similar way as was done in point 1 and 2 mentioned above. Step 3: In the transportation table, begin from the new north-west corner and repeat steps | and 2 until all the requirements are satisfied. Advantages of North West Corner Method 1) This method offers step by step solution and hence proves to be very effective. 2) In this method, optimum solution is obtained in a very simple manner. Disadvantages of North West Corner Method 1) This method does not consider cost factor which is sought to be minimised. 2) To obtain optimal solution, North West Comer rule takes more time. Ques) Find the feasible solution of following transportation problem by applying NWC method: oe [R [ Suppiy | _A T7 e 0 = t | dD. I {16 Demand | joa) ‘Ans: To compute initial basic feasible of transportation problem using NWC method, the steps are as follows Step I: First select the cell located at the North-west ‘above table, e., cell (A, Py cornes Step 2: Now allocate the possible minimum value taken either from supply or demand, ic., minimum (7, 9) = 7. Hence allocate minimum value 7 at the cell (A, P) Step 3: As the whole supply (7) of A is finished, hence shift to other cell (B, P). Step 4; Total remaining demand at the P is now 2 units So min (9, 2) =2. Allocate this unit (2) at the cell (B, P) «|? | @ ole po) 3 * | li 0 Demand | 9 3 20 Step 5: Since the demand is exhausted at the cell (B, P), we move to another cell (B, Q). Here the total remaining supply is now 8 units. So min(8, 13)=8 Allocate this value (8) at the cell (B, Q) Step 6: Total supply at the B is now finished, hence shift to another cell (C, Q). The remaining demand at Qis 5 units. Select the min(S, 9) =5 Total Transportation Cost = 4 x 7 + Allocate this unit (5) at the cell (CQ) Step 7: Since the total demand at Q is now exhausted, hence the remaining supply at the C is now 4 units. Move to another cell at (C, R). Choose min (4, 20)=4 units Allocate this unit (4) at the cell (C, R). Step 8: Now remaining demand is now 16 units and total supply is also 16 units. Hence allocate this at the cell (D, R), Since the total number of allocation (6) equal to m (row) +8 (column) ~ I= 443 — 6, hence the solution is Feasible TCH4x7 45% 245 x8 46x 549x444 16 10 +40 + 30 + 36 + 64 = 2208ae BCA, Third Semester TP Solved Series (Operations Research-1) RTMNU ‘Ques 10) Applying the North-West Corner method, solve the following transportation problem: Ta x ¥ z w_| supply D, 4 5 5 «|» From D: 3 7 2 s | as Ds 5 4 4 a | ou Demand 9 B w | 7 « ‘Ans: Using the North-West Comer metho, the following allocations of units will be shown below: x Y Zz ‘W | Supply » | o >| © [ono veil op | 3s | 7@)2@ | sf ise fom fos fe | @/s@) an Demand | 910 138 644 m | 4s ‘Total Transportation Cost = 4 x 9+ 5x 10+ 7x3+2x12+4%443%x7=36+50421 +244 16+21 = 168 Ques 11) Applying North West Corner Method, solve the following transportation problem: To Supply - From A B ce | » ‘ orn . o 6 8 7_|_ 2) 30 : ey io 3 >| a0 Os & 10 [24900 z Demand | 700 $00 | 400 | 300 | apt ‘Ans: Here the Total demand = 1900 and Total Suppl total demand is not equal to total supply. For makin; supply 100 units. '800. It is not a balanced problem (i.e., unbalanced) becat.. this problem balanced, we add a dummy row with value 0 and 5 To] From A B © D Supply 4 - Gao} oO 6 8 v 2 500 a 10 u 400 0; 8 so oO | Goo} (ummy | ° . 7 7 Ne ~ 1900 Demana | 700 | 00 | aco | aw | oe Total Transportation Cost = 6 x 500+ 10x 200 + 13 x 200 + 10 x 300 + 12 x 400 + 14 x 200 +0 x 100 = 3000 + 2000 + 2600 + 3000 + 4800 + 280040 = 18200‘Transportation Problems (Unit 3) Ques 12) Explain the Row-M ima method. Ans: Row Minima Method To determine the initial feasible solution for a transporation problem using the row minima method, the following steps are involved: Step 1: In the first steps select the least cost cell (ey) in the first tow of the transportation table, The maximum possible amount is allocated in this cell, so that either the capacity of the origin O is exhausted or the requirement at destination D, is satisfied, or both. Step 2: There are three cases i) If xy = a so that the availability at origin O, is completely exhausted, cross-out the first row of the table and move down to the second row. ii) Lf xy = bso that the destination D, is satisfied, exoss- ‘out the j” column and re-consider the first row with the remaining availability of origin O, If xy = a1 =by, the origin capacity of O, is completely exhausted as well as the requirement at destination D, is completely satisfied. An arbitrary tie-breaking choice is made. Cross-out the first row and make the second allocation Xi = 0 in the cell (1, k) with ey being the new minimum cost in the first row, move down to the second row. Step 3: ‘transportation are satisfied. iii) and 2 for the resulting all the rim conditions Repeat steps 1 table until Step 4: Finally, prepare the initial basic feasible solution . BO It not only exhausts the availability of the origin O; but also fulfils the demand of Ds. Therefore move down to the third row. ‘Step 3: In the third row, make the following allocations, xy = min (9, 7 xs = min (2, 2)=2 Hence all the rim requirements are satisfied. Step 4: The initial basic feasible solution by the row ‘minima method is displayed in the table given below: a p;_| Ds | De © oO} 4 2 5 3 | 0 O,) 5 4 x | 13re0 os} 1 4 6, 5 | 9nI0 7 820 50 80 It is degenerate as the number of allocated cells is $ which is less than m+n-1=443-lie..6. ‘The transportation cost (TC) = 2x6 +3x5+2*8+1x 744 x2 = 58 units Ques 14) Solve the following transportation problem by Row Minima Method: ‘and calculate the initial transportation cost. Al Bic) oD Supply _| —, 4[6|3 [2 20 | ‘Ques 13) Determine an initial basic feasible solution of F 1{s [als 30 the following balanced transportation by c @p3p2]4 40) row minima method: H 3[6]s | 2 70 | Destination Demand 50 | 30 | 40 | 40 Di Ds Dy Dy ho wns: Applying the row mi steps are as ola 7 5 3 [6 Ans Applying minima method, the steps are Step 1: First choose the cell with minimum cost in the first Origin | 2} 5 4 3 2 [13 row. It is the cell (E, D). Allocate minimum of the availability in the first origin (20) and demand in the o| 1 4 6 5 | 9 fourth destination (40), i., min (20, 40) = 20, to this cell: 7 8 5 = So the first origin is exhausted and the demand at the ‘Ans: The steps are as below: Step 1: The lowest cost in the first row is 2 and it occurs inthe cell (1, 2). So allocation x, = min(6, 8) = 6 In this cell and it exhausts the availability of the origin O, So we move down to the 2 row. Step 2: In the second row, the minimum cost is 2 and it ‘occurs in the cell (2, 4), So allocation Xa4 = min (13,8) =8 Tn this cell and it fulfills the demand of the destination Dy but the availability of the origin Or is not exhausted, S ng the unallocated cell So again select the lowest cost among i : of 2” row and it is 3, occurred in the cell (2, 3), Then allocation x» = min (5. 5 fourth destination remains to be 40 ~ 20 = 20. a TB [© [2 | Supply E a]o6|a 20 | F 1 sfajo | » « sf>sJe2l+|[* " 3]o6 fs |2i] 7» Demand | 50 [| 30 | #0 —]De ‘Step 2: Now go to the second row and find minimum cost in the second row that is cell (F, A) and allocate min (30, 50) = 30 to this cell. So second row is deleted. BCA, Third Semester TP Solved Series (Operations Research) RTMNU, ‘Theretore, the solution is xy= 20 4 A] 3 Tey D | ia tt s ce la | @ Transportation Cost = (2 x 20) + (1 x 30) + (2 x 40) + r “tes | 0 (3 20) + (6 30) + (2x 20) = 450. | Ques 15) Determine an initial hasie feasible solution for F i 30 the following Transportation Problem using Row _ ima method: (2018105) 6 sta f2)4] Destination Source | D:D; Ds __Ds | Supply " 2 8) s | 2 | a Ss wo 2 2 | Is Demand | 50 [30 | 40 | 0 s. 2 79 ow] os ‘Step 3: Again go to the third row and find the minimum Ss 44.6 8 | 0 element in this row, that is cell (G, C) and allocation in = as this cll is min(40, 40) = 40 Demand | 5 18 1 [ATs Te Tb [supp ‘Ans: In {* row, the smallest transportation cost is 2 in cell | SD je fo da | I} ow The allocation to this cell is min (15, 15) = 15 Table3.1 | F sj 4 | 9 | 3 Di[ Ps _[D. [Ds | Supply | a @ © © |e fa} Mla |] «0 &_ [ela] 9 [ao] 3 s _|4 [1a [is [is] 10 Demand [5 [0 [as [is x S.f.¢ |] 2 |B In 2 row, the smallest transportation cost is 7 in cell SDs, The to this cell is min(25, 0) = i The allocation to this cells min(25, 0) =0 Now 3% row is deleted and go to 4" row. Step 4: Again applying the same method, in the fourth row, in this row the minimum element is 2'in the cell (H, 1D) and allocation in this cell is min(20, 70) = 20. Now the demand D is exhausted and go to next minimum clement in that row that is 3 in cell(H, A) and allocation in this cell is min(20, 30) = 20. Now’all the supply is not exhausted hence the remaining supply 30 is allocated to cell (HB). ATs [e¢ ‘Supply 20 OF This satisfies the entire demand of D, and leaves 25 — 0 = 25 units with Table 32 D. | D: | Ds], | Supply = Tel tny o Fs | 8_|4 [a fis{is [10 Demand [5 [0 [is [is In 2 row, the smallest transportation cost is 9 in cell S,Ds. The allocation to this cell is min(25, 15) = 15. ‘This satisfies the enti 10 units with $;, 5: In 2 cow, the smallest transportation cost is 12 in cell ‘S:Dj.-The allocation to this cell is min (10, 5)Transportation Problems (Unit 3) ‘This satisfies the entire demand of Dy and leaves 10-5 = 5 units with Sp eae Pope ehts pO oS att In 2 row, the smallest transportation cost is 20 cell :D.. The allocation to this cell is min (5, 15) 5. ; This exhausts the capacity of $, and leaves 15 - 5 = 10 units with Ds. bss i) If my =b, eross-out the first column ofthe transportation table and move towards the second column, ii) If xj) = a, cross-out the i row of the transportation table and re-consider the first column with the remaining demand iil) If xy =b,= a, cross-out the i" row and make the second allocation xy; = 0 in the cell (k, 1) with c,; being the new minimum cost in the first column, Cross-out the column and move towards the second column ‘Step 3: Repeat steps | and 2 for the reduced tran -ortation table until all the requirements are satisfied, Step 4: Finally, prepare the initial basic feasible solution ‘and the total intial transportation cost is calculated. Ques 17) Determine an initial basic feasible solution to Tubte3s the folowing balanced” transportation problem by D, | D: [Ds D, [| Sapply | column minima method: se Peay Destination pope oy Sa Sao 3 aos pepe QO @|_ S| orn (rept ot | Ss 4 14 16 18 10 0; 3 4 7 5 34 Demand [0 [0 [05 Demand is [ea In 3” row, the smallest transportation cost is 18 in cell ‘$3D,. The allocation to this cell is min(10, 10) ‘Ans: The column minima method consists of following steps: Step 1: Smallest cost in the first column is 3 and occurred in the cell (3, 1) so allocation x3, = min (34, 16)= 16 in this cell. Table 36 Db | ps |p. [ Supply ___ Destination & 0 Dy _| Ds | Dy | Ds | Supply w [2@l» Ja + oO s | 3 } 2 & [7 a &) 2] ® (S} a T / S 7 |e 7 rigin | O2 4 ofa | ” Demand | 0 [0 j 05 4 [7 ) 5 | 3a Initial feasible solution is: | | | Table Demand |_160_[ ve | 1 | 35 | D [em [ps jm Supply _| x This fulfils the demand of the destination D, and the 0 |?@|* a Hi availability of the origin Os still remains 34 + 16, ie., 18. = m TT > 12 3s Now goto the 2" column, © Step 2: Smallest cost in the second column is 3 and it O| © occurs in the cell (1, 2). So allocation in this cell is x;2 S a [a pe fe 0 min (19, 18) = 18. masta Dy | Ds _| Sopply Demand [3] os [as [5 ~D_|_D._| Soppiy | , oO E 2 | 19 ‘The minimum total transportation cost , 6 | 2x15 412x549 x 15 +205 +18 10 | ata. o a} ofa] Ques 16) Describe the column minima method, + s a | @ ‘Ans: Column Minima Method % = a aang Step 1: First determine the smallest cost (cx) in the first L. ceca column of the transportation table. Next Allocate x, = min Demand | io [wo | sits | 4 (, by) in that cell G1). Step 2: There are three cases: Now 2 column is ‘The remaining supply is (19 ~ 18) deleted and goes to third columnDew Step 3: Smallest cost in the third column is 6 and it occurs in the cell (1, 3). So allocation in this cell is x15 = min QL D=1 After allocation the remaining demand is (31 — 1) = 30. Hence in the next greater clement 7, the allocation are x, = 18, Similarity the next element is 9, in this the allocation are 12. BCA, Third Semester TP Solved Series (Operations Research-l) RTMNU ‘Ans: Applying Column minima method, we have the following solution, upply 4 60 F ‘ielean ele ls [2 @lo |e | Dd. | Dy hy IS 4 ro aye ce lo@ls [2 |@fiase | | “ ; oO S| 3 eo} 2 | 190 |= | | | ® - Origin) 0; / 4 7) 9] a | sans Transportation Cost. =0x 642%841%6 | | +12+16+6=34 Lo a] « ® s | s4ne0 Ques 19) Deseribe the Least Cost method with its | advantages and disadvantages. ‘Demas Or ma {_t6o | 180 | 3100 [25 Explain the matrix Minima method. Or ‘Total demand is exhausted hence go to the fourth column. Step 4: Smallest cost in the fourth column is 1 and it ‘occurs in the cell (2, 4). So allocation in this cell is x. = min (25, 25) = 25, ‘The initial basic feasible solution by the column minima ‘method is displayed in the table given below: Dd, Lo 5 Origin | Oz 4 os ® |» (Demand [ie [is [31] 35. ‘Transporation Cost (TC) =3x 18+6x1+9x 1241 x. 2543x1647 x 18 = 5446+ 108 +25 +48 + 126 367 ‘Ques 18) Find the initial basic feasible solution to the following transporttaion problem by column minima method: pe |e | G | supply A 1{/2{[3/[4{[.« afaf2fofs foc) Fo f 2 fafa] “pemna | 4 | 6 |e | 6] Transportation (2018103) Write an algorithm to solve the Problem using Matrix Minima method. ‘Ans: Least Cost / Matrix Minima Method ‘The Matrix Minima/Least Cost Method is another method used to obtain the inital feasible solution for the transportation problem. Here, the allocation begins with the cell which has the minimum cost. The lower cost cells are chosen over the higher-cost cell with the objective to have the least cost of transportation ‘The following steps are involved in the least cost method: Step 1: Select the cell (O,, D,) from the transportation table which has the minimum unit cost and allocate maximum possible 0 this cell. That row or column is, eliminated whose demand and supply requirements are satisfied, If there is any tie in the smallest unit cost for two ‘or more cells then one selects that cell in which maximum allocation is possible. Step 2: For all remaining rows and columns, adjust the supply and demand. Repeat the process among. the remaining rows and columns with the smallest unit cost Step 3: The process will continue uni the supply at various origins and demand at various destinations are fulfilled Advantages of Matrix Minima/Least Cost Method 1) In this method transportation cost is considered and hence it provides accurate solution 2) Im this method, it is eayy and simple to caleulate optimum solution Disadvantages of Matrix Minima/Least Cost Method 1) This method does not provide the solution which is loser to optimal solution. 2) This method does not follow any systematic rule in the situation when there is a tie in the mininnum cost and personal observation is used for the selection of allocation cell.‘Transportation Problems (Unit 3) Ds Ques 20) Applying the matrix minigia method, solve the following transportation problem: Ay] A: [Ay [Aa [Supply | x | s [2] se | 6 | 4500 X 7 1s 7 B 6000 Xs s 9 10 un 7000_| Demand | 6000 | 4800 | 3000 | 4000 | 17500 | ‘Ans: Following allocation will appear while applying the matrix minima method To : From A A AS ae Supply x 050000 | X 003000) | a | 1 x 00a 0007 : Demand 17500 Total Transportation Cost (Ques 21) Find the optimal solution of the following transportation problem using least cost method: 12 x 500 + 6 x 4000 + 15 x 3000 +7 x 3000 + 5 x 6000 +9 x 1000 = 6000 + 24000 + 45000 + 21000 + 30000 + 9000 = 135000 (201705) Godown [GG Gs G. | Supply | Bf? 3 " 7) 6 puns) oP {2 0 6 4 ot ‘Ans: The smallest transportation cost is 0 in cell The allocation to this cell is min (1, 5) = 1 ‘This exhausts the capacity of P, and leaves 5 ~ The smallest transportation cost i ‘The allocation to this cell is min (6, 7) = 6. ‘This exhausts the capacity of P) and leaves 7 cell PG, 6 = L units with G, crtD6 ‘The smallest transportation cost is 5 in cell P\G, The allocation to this cell is min (10, 1) = 1 ‘This satisfies the entire demand of G, and leaves 10 ~ BCA, Third Semester 7P Solved Series (Operations Research-I) RTMNU 9 units with Ps Table 3.10 G | G: [Gs[ Gs | Supply ® ?oO > ["t7] ° PB | 1 | ométit 0 PB [5 @) 8 [is] 9 9 Demand | o [4 [3 | 2 ‘The smallest transportation cost is 8 in cell PsGa ‘The allocation to this cell is min (9, 4) = 4. ‘This satisfies the entire demand of G> and leaves 9-4 = § units with Py “The smallest transportation cost is 9 in cell PAG, Table 3.11 - GT GT G, | Supply PB | 2@] 3 [ula o Py U om) 6] 0 Py 30) 8@) SP 9 Demand | 0 0 2] _J The allocation to this cell is min (5, ‘This satisfies the entire demand of G, and leaves 5 —2 = 3 units with Py ‘Table 3.12 [ G | G: [Gs] Gy | Supply Pp @ 3 [ut 7 Oo. Py 1) metry o | BD ETO Demand | 0 | 0 [3 station cost is 15 in cell PsGy G3 ‘The smallest transpor ‘The allocation to this cell is min The minimum total transportation cost = 2*6+0%x 145% 1 Here, the number of allocated cells = is equal to m +n ~ This solution is degenerate +RxS4ISHR 4D 6 +4‘Transportation Problems (Unit 3) {Ques 22) Find the initial basic feasible solution of the following transportation problem using least cost method: Fe} ws] wi | ws | ve | Sopety fon [atofsai{s| 2 B s|2[s|[2| ¥ 7/ila[s| Demand s{o}w[s| x Dr ‘Ans: To find out the minimum transportation cost, first select the cell having minimum cost and then allocate the maximum possible units in that cell In case there are two cells have minimum cost (tie) then select that cell in which the maximum allocation of units is possible, To Ww, WwW. Ws We ‘Supply Fromm R 4 6 3 ° 2 R s 2 s 2 B BR 7 1Q} «4 8 von Demand s | 90 0 8 35 = | ‘The minimum transportation cost (I) occurs in the cell (Fs, W2) as shown in table above. Hence allocation at this cell is min (9, 10) = 9 units. Now the demand at the W2 is fully exhausted, so cross-out this column, ‘The remaining supply at the F) is now | unit. Until the total demand and supply not consumed fully, repeat this step for other cells also, ‘The final allocation table will be as follows. fos Ww, Ww: Ws We Supply Lerom nw | «Qe | se Fie * Qf fos | 2@ iso 1 Pe Ore re rer Demand | 8/6/10 90 10% wo 35 Since allocations (6) are equal to m (row) + n (column) Total Transportation cost. = 8430425 +16+749 =95 X2+3KIOFSXSHIXBHTAIFIXD 6, hence the solution is feasible.oa NCA, Thint Semester TP Solved Series (operations Research) RTMNU Ques 23) Solve the following transportation problem: Sorsy ] 1 Fronts wel ow wel Ws ‘Supply TN 1“ | wha false | mi) « wis fw) aw fs | ww | Ms SS ni) 4 a 180, wf mis) ww | wo | ow | ‘Ans: Applying the matrix minima method, we obtain the following allocation table | ] w fom | ow fom = | } oO s@ 2G sO a |r| Demand | rowsay | awiwo [sow [—awo | sow we Here, the number of allocations (7) is equal to m (row) + w (column) =F S— LT © the solution is feasible. Total Transportation Cost = 20 x 50 + 33x 60+ 25 x 404 352504 $5 x 10-422 5044340 1000 + 1980+ 1000 + 1750-4 9504 1100-41720 = 9100 Ques 24) Obtain an initial basic feasible solution (o the following transportation problem using least-cost method: oe 1| Demand o[ 2 Where 0, and Dy denote origin I" and j* destination respectively, 2017105) Ans: The smallest transportation cost is 0 in cell O30, ‘The allocation to this cell is min (8, 6) = 6. ‘This satisfies the entire demand of D, and leaves 8 ~ 6 = 2 units with Oy Table Demand | 4] 6) ek) oO ‘The smallest transportation cost is 0 in cell OD, The allocation to this cell is min (10, 4) = ‘This satisfies the entire demand of Dy and leaves 10-4 = 6 units with Oytransportation Problems (Unit 3) Dy | Supply | af 6] 0 2 The smallest transportation cost is 2 in cell ODy ‘The allocation to this cell is min (6, 8) = 6 This exhausts the capacity of Oy and leaves 8 6 = 2 units with Dy _ Table 3.16 Di [Dr] Dy | De | Supply oO Oe 6 O 2 Oy 6 ~Dema nd ‘The smallest transportation cost is 2 in cell OD; The allocation (o this cell is min (6, 6) = 6. Table 3.17 _ - D; | Ds | Ds | Supply 2 [4 0 ao |a fs [2] @ ? Os °@| 2 - |! a) Demand | 0 o [2 of | {The smallest transportation cost is 2 in cell O:Dy The allocation to this cell is min (2, 2) eae - D: | Ds | Ds | Supply Or i 26) 3 | 4] o 0: 4 3 2e@| °@ 9 Oy 2? 26] | 0 0 0 o fof} Initial feasible Solution is, _ D, | D: | Ds ‘Supply 0; a 3 6 Oo | 4}3 q 8 05 e ' 10 Demand | 0 | 6 6 ‘The minimum total transportation cost 2x642x240x640x442x6=28 Here, the number of allocated cells = 5, which is one less than to m +n ‘This solution is degenerate. 344-15670 BA, Thind Semester TP Solved Series (Operations Research-}) RTMNU ‘Ques 25) Determine the initial basic feasible solution using LCM and NWCR, 2016 (05)) Destination Di [Ds] | S| ai} wf as] 3 Supply | ss | a7] a | 4 | 23 | as s [alafi a] | Demand | 6 | 10 | 12 | 15 ‘Ans: Least Cost Method (LCM) Total number of supply constraints: 3 Total number of demand constraints: 4 Problem Table is ee D, D, Dy De Supply 5 2 16 1s 3 1 Ss 0 18 4 3 B Ss 2 7 | 4 ot Demand 6 10 2 is : | The smallest transportation cost is 3 in cell $D,. The maximum which can be allocated to this cell 11. This exhausts the capacity of $, and leaves 15 ~ 11 = 4 units with Dy ‘Table 3.19 Di [| D: | Ds | Ds [Supply s | a | i | as Do s | i7]w fw] a fo s | 2 | 2 | ow fa | Demand) 6 | 10 | 2 | 4 ‘The smallest transportation cost is 14 in cell S;D,.The maximum which can be allocated to this cell 12 ‘This satisfies the entire demand of D, and leaves 1312 = | units with S. ‘Table 3.20 Dd D, Dy | Supply s jal wf s | @ o s |o] we] w@ ow | Ss 3 | 27 8 a 9 Demand [6 | 10 0 4 ‘The smallest transportation cost is 17 in cell S:D,, The maximum which can be allocated to this cell 1. This exhausts the capacity of Sy and leaves 6 ~ | =5 units with D; Table 321 Dd D [Ds D,_| Supply s | a | wf | @ o s | n©w] uw» | o 3 | 3 7 18 al 19 Demand [5 10 0 4 ‘The smallest transportation cost is 27 in cell $;Ds. The maximum which can be allocated to this cell 10. This satisfies the entire demand of Dz and leaves 19 - 10= 9 units with Ss‘Transportation Problems (Unit 3) pa © Table 3.22 DD Py Supply Ss ” 6 15 0 | s © 18 @ 2a 0 Sy 32 @ 18 41 9 Demand] 5 o ° 4 L ‘The smallest transportation cost is 32 in cell $;D). The maximum which can be allocated to this cell 5. This satisfies the ‘entire demand of D and leaves 9 — $= 4 nits with Ss Table 323 _ Dd Dd: Dy D, [Suppl sta lw ls | ® o & ” 6 14 B o ss 2 2 is a | 4 Demand] 0 ° 0 4 | “The smallest transportation cost is 41 in cell $3Ds. The maximum which can be alfocated to this cell 4 Table 324 Dp | Ds Supply Ss 21 16 1s o S: n@) 8 0 ss | "@| " “w) ° Demand) ° o ° Final Allocation Table is Di Dy Dy Dy Supply s | a] ow low | Ou s | @> we |) uO)» | o ss »@| "ol " |” Demand} 0 ° ° 0p72 CA. Third Semester TP Sotred Series (Operations Research-1) RTMNY ‘The minimum total transportation cost = 3 x 1] +17 x 1 + 14x 12+ 32x5 427 x10 +41 x4 =812 Here, the number of allocated cells = 6 is equal tom +n-1=3+4-1=6 This solution is non-degenerate North West Corner Method(NWCM) Total number of supply constraints: 3 Total number of Demand constraints: 4 Problem table is: D, | Ds |, |b, | Supply s fajwfisf3] nu Ss |irjie} fos] 3 Ss | 32] 27) jar] 19 Demand | 6 | 10/12) 15) The rim values for S = 11 and Dy = 6 are compared. The smaller of the two i.e., min(11, 6) = 6 is assigned to SD. This meets the complete demand of D, and leaves 11 —6 = 5 units with S; Table 3.25 Di | bs | Ds | Dy [Supply| }s | ais] ois [a | s | & vj w | wf a] Demand) 0 [| 2 | ‘The rim values for $; = 5 and D; = 10 are compared. The smaller of the two i.e., min (3, 10) = S is assigned to S,D;, This exhausts the capacity of S; and leaves 10 ~ 5 =$ units with Dy Table 3.26 [Lb [| Bb: | Ps | De | Supply] ) os | a} iw) as 3 | oo | | | | | s | 7] | ow) a |) |] | | | } sy | 3x2 | 2 | a | a | os | | \ [Demand Le [8 7] are compared. The smaller of the two ie., min (13, $) = 8 units with Sp ‘The rim values for S; = 13 and D; = is assigned to S. meets the complete demand of D; and leaves } Supply St 3] 0 T Sr 2 | oa s | 2 far tow | a | os Denna) 0 | 0 | 2 | is‘Transportation Problems (Unit 3) baa ‘The rim values for S) = 8 and D; = 12 are compared. The smaller of the two j.e., min (8, 12) = 8 1s assigned to S:D,, This exhausts the capacity of S> and leaves 12 ~ 8 = 4 units with Dy Table 328 | DB; | Ds | Ps [Supply OM Os). | o s |u| Of ® » Jo Ts |» fa | a | os Demand] 0 | 0 | 0 | 15 I The rim values for S) = 19 and D, = 4 are compared. The smaller of the two jve., min(19, 4) = is assigned to Si meets the complete demand of Dy and leaves 19 ~ 4 = 15 units with Ss. ». This Table 329 C Di | D:; | Ds | Dy [Supply s | M Os] |e (Ss 7 1s & 23 0 Ss: 32 7 18 4) 19 Demnaf 0 [0 | «| | ‘The rim values for Ss = 15 and D, = 15 are compared. The smaller of the two ie., min (15, 15) = 15 is assigned to SsD. Tabie330 Dy D: Ds Dy S| « ) Os] s fo | slo) O Wm fo | s jalan) o & “| Demat 0 pe | Final Allocation Table is. ‘Table 3.31 Do] bm: | Ps | P |Suppiy| bs fo] OF Be [0 | GO © | Demand) o | to | 12 is | ‘The minimum total transportation cost = 21 x6 + 16 x54 1854+ 14x84 18 x4 441 x 15 = 1095 Here, the number of allocated cells = 6 is equal to m+n—1=344 *, This solution is non-degenerate 6pa BCA, Thil Smet TP Solved Series Operations Reseach.) REMY Ques 26, Determine an iii basic feasible solution to the following Transportation Problem using North. Wee Corner-Rul (orgies D Supply o [6 4 1 5) Oo |8 9 7| 16 Oo [4 3 6 2) 5 Demand | 6 10 15 4 ‘Ans: The rim values for O; = 14 and D, = 6 are compared. The smaller of the two, ie., min (14, 6) = is assigned 0, D, This meets the complete demand of D; and leaves 14 ~6 = 8 units with Oy Oo, Oo, Os Demand The rim values for ©, = 8 and D; » = 10 are compared. The smaller of two, ic. min (8, 10) = 8 is assigned to O, Dy This exhausts the capacity of O; and leaves 10— 8 = 2 units with D, Ds | Supply | s| a 7/16 o fafa elo] s Demand) 0 | > fas] a ; The rim values for O3 = 16 and D; = 2 are compared, The smaller ofthe two, ie., min(16, 2) = 2is assigned to Os Dy ‘This meets the complete demand of D3 and leaves 16 =2= 14 units with O} Table 3.34 Tp o 6 oO: 8 o 4 Demand [0 [0 | 15 fa a The nim values for Op = 14 and Dy = 15 ate compared. The smaller of the (Wo, Le.. min (14, 15) = I4 is assigned to O; Dy This exhausts the capacity of Oy and leaves 15 14= | units with D,‘Transportation Problems (Unit 3) b7s o |_% o [6 ‘Demand | 0 ya] | The rim values for O, = 5 and D, = 1 are compared. The smaller of the two, i.e. min (S, 1) = | is assigned ( Os Dy This meets the complete demand of Dy and leaves 5 ~ 1 = 4 units with O, i Table 3.36 [o. [p, [Ds oO | ‘a @ 1 Oy kok Oy Demand | 0 ‘The rim values for O, = 4 and Dy = 4 are compared. The smaller of the two, i... min(4.4) = 4 is assigned to) Dy Initial feasible solution is ‘The minimum total transportation cost =6 x6 44x 8+9X2+2x1d+6x1+2%4=2128 Ques 27) Explain the Vogel’s Approximation Method (VAM) with its advantages and disadvantages. Or Explain Vogel's Approximation method for finding an initial basic feasible solution of a transportation problem. (2016 (05) Or Discuss Vogel's approximation method to find initial basic feasible solution of transportation problem. (2017{05)) or Write and explain the steps to solve the Transportation Problem using Vogel's Approximation Method. (2018[05)) Ans: Vogel's Approximation Method (VAM) ‘The vogel's approximation method is preferred for obtaing the initial hasic feasible solution because the obtained solution is either optimal or very close to optimal solution, Hence it takes less time to reach the final solution. Various steps involved in Vogel's approximation method are as follows: Step 1: Identify the smallest and next-to-smallest cost in each row of the transportation table. For each row caleulate the differences between them which are known as ‘Penalties’. Write the penalties of each row and column alongside the transportation table against the respective rows and columns. . Step 2: Among all the rows and columns identify that row and column which has the largest penalty. Select the cell with least cost in this identified row or column and allocate the feasible number of units to this cell. ‘That row or column is climinated whose demand and supply requirements are satisfied. If there is any tie in the largest penalties for two or more rows then one selects either of them. Step 3: For the reduced transportation table repeat the step | to calculate the column and row penalties and then go w step 2 Repeat the process until all the requirements are satisfiedpas CA. Third Semester TP Solved Series (Operations Research-1) RTMNU Advantages of Vogel's Approximation Method 1) Tis a very systematic method 2) The time required to solve the transportation problem is comparatively less 3). This method involves less number of computations Disadvantages of Vogel’s Approximation Method 1) The solution which is provided by this method is nearest to the optimal solution 2) This method proves to be tedious when the given matrix is large Ques 28) Determine the optimal solutions of following transportation problem so as the products are transported at 2 lowest cost. The table below shows the cost structure of transportation problem: —+— i Tos ] Fr Foo Ry | Fy Supply | 1 | a petetips [om] Oo; 8 9 2 7 16. a [2pets tet os Demed Tie bas ba [as Ans: The steps of Vogel’s’ approximation methods are as below: ‘Step 1: Initially calculate the penalties of each row and column by subtracting the two smallest costs. Step 2: Now detect the high penalty in each row and column. Step 3: At the lowest cost cell of row or column that has high penalty, the maximum possible allocation can be done. Step 4: If the allocation is exhausted to any row or column, then that row or column is calculated again for other rows or columns. eliminated, Next the penalty is Step 5: Repeat the above procedure until the whole demand and supply is not fully consumed, wpantnls Fe | Supply Penalty From! | | lumivyv a | © @Prme|s viiis Lr] | o wi | s 12~- | ‘ | 9 4 {— ~| 5 | al 4 Me |i aaa T —— af | Demand | 10 | 12 | is 45 | oe ot 1 4204 \ m4 2 es om Q = 1 v A 31 vt a Total Transportation cost HID4 S24 2K ISH IX 142% 1044 KS B+ 1043047420420 35‘Transportation Problems (Unit 3) pn Ques 29) A company works at six places. It has three cement plants located at the places X, Y and Z and these are ing 50, 40 and 60 units daily. Company has also three distribution centres located at the place P, Q and R with daity demands of 20, 95 and 35 units. The following’ table shows per unit cost of shipping to distribution centres from ‘manufacturing plants. Find out which route the company wants to follow in order to minimise the total transportation cost. “Distribution Centres { Plant |X | HA ‘Ans: After implementing the Vogel's approximation method (VAM), the following allocation table will be shown - Pr | Q x | Sere u “a Woy x - .tefl? ess 5 Demand 20 35 | 150 1 2 0 1 Penalty 1 2 0 - m | 0 woe 0 vo St Total Cost = $x 15 + 1x35 +3% 204 8x 2045 x 60=75 +35 +60 + 160 +300= 630 Ques 30) Determine optimal solution of the following transportation problem in order to minimise product transportation cost. The structure of per unit cost is shown in table below: Cx TY |Z | Supply Pie {a9 [a2 | as Te fir fis {16 Riis} of | Demand | 10/17 | is [42 ‘Ans: After implementing the VAM method, we have the following allocation table Penalty [ x Y z 10m Wey P else ea 6@_ "© ©, @ * a n | 1@ » |e pot 2 Ry 4 18 o@ " 10 " is | 42 1 2 7 3 Be 2 L 3 a mt ist 2 Bowie = 2 v - atDare CA, Thin Semester TP Solved Series (Operations Research.1) RTMNU The allocation will be as follows: Allocate 10 to cell (P, X) = 160; Allocate 1 t0 cell (P, Y) = 19; Allocate 4 to cell (PZ) = 48; Allocate 16 to cell (Q. Y) = 176: Allocate 11 to cell (R, Z) = 99 Total Cost = 160 + 19 +48 + 176 +99 = 502 ‘Ques 31) What are the different methods of optimal solution? or Discuss the Stepping-Stone and Modified Distribution Method (MODI). Or Explain the formation of loop with example, ‘Ans: Optimal Solution/Test for Optimality Once the initial basic feasible solution is obtained, the next step in this method is to test whether the obtained solution is ‘optimal or not. There are two methods which are used for optimality test of a basic feasible solution 1) Stepping-Stone Method: In this method, the optimality testis performed by calculating the opportunity cost for each empty cell, This method involves the procedure of determining the potential, if one exists, to improve each of the non- basic variables with respect to the objective function, Next step is to find out what would be the effect on the total cost if one unit is assigned to each such cell considered above. With the help of this information, we get to know whether the solution is optimal or not. If the solution is not optimal then one improves the solution Steps of Stepping Stone Method Step 1) Find an initial basic feasible solution using any one of the following: i) North West Comer Rule ii) Matrix Minimum Method iis) Vogel Approximation Method ‘Step 2) Let ‘m’ is the number of rows and ‘n’ is the number of columns. Itis noted that the number of occupied cells is exactly equal to m+ n— 1 Step 3) Choose an unoccupied cell. Start at this cell and trace a closed path from it, until finally you return to the same unoccupied cel. ‘Step 4) Plus (+) and minus (~) signs are assigned on each comer cell of the closed path at sltemate basis. Assignment starts with the plus sign at unoccupied cell to be evaluated. Step 5) Unit transportation costs are added which are associated with each of the cell traced in the closed path. This prov Step 6) Steps 3 05 are repeated until all unoccupied cells are evaluated. Step 7) If all the net changes computed are less than zero then the current solution requires to be improved and the {otal transportation cost will be reduced, Then move to step 8 Step 8) Chvose the unoccupied cell which contains the most negative net cost change and find the maximum number of units that can be allocated to this cell, The number of units that can be shipped to the entering cell is indicated by the smallest value with negative position on the closed path. This number is added to the ‘unoccupied cells which are lying on the marked path with a plus sign. This number is subtracted to the cells which are lying on the marked path with a minus sign Finally the solution obtained is optimal if all the values of unoecupied cells are greater than or equal to zero. les net changes in terms of cost. Formation of Loops in TP ‘An ordered set of four or more cells is Said to form a loop if it has the following conditions Condition 1: Any two adjacent cells of the set lie either in the same row or in the same column; and the same row or in the same colu Condition 2: No three or more adjacent cells lie The first cell of the set will follow the last one in the set, One get a closed path satisfying the above conditions (1) and (2) if he/she joins the cells of loop by horizontal and vertical line segments, Properties of Loop 1) Every loop has an even number of cells. . ii) A feasible solution to a transportation problem is basic if and only if, the corresponding cells in the transportation table do not form a loop.ororaicn Problems (Unit 3) bas for example, let consider two sets X = {(1, 1), (4. 1), 4, 4), (2, 4). (2.3) (1. 3)} and X°= (B,D, BA), (2, 4,02, 3), @.2.(1.2.0. D) Where. (i, j) denotes the (i, j)" cell of the transportation table. Then itis shown that the set X makes a loop whereas the set does not make a loop, because cells (2, 4). (2. 3) and (2, 2) occur in the same row. Figure below shows loop and oo-loop conditions: Loop alas] [tL testa an (4) i method to test whether the ) Modified Distribution Method (MODI); MODI method proves to be an effi stone method. In determined solution of @ transportation problem is optimal or not when compared 10 steppin; stepping-stone method, a closed loop is drawn and the opportunity cost of each empty cell is evaluated. This proves to be acomplex exercise and takes long calculation time if a large number of sources and destinations are involved ‘The number of steps required in the evaluation of the empty cells in MODI method is less and it avoids the extensive scanning as done in stepping-stone method. We can determine the opportunity cost of each of the empty cells with a straightforward computational scheme in MODI method steps of MODI Method Step 1: Add a column on the right hand side and a row in the bottom of the transportation table titled u,and v. respectively In this step following sub steps are performed: i) For the rows/columns which have maximum number of allocations, select the value of u, and ¥, cqual to zero, Normally, the first row has allocated the value O(zero) ie, u ii) In the first row, consider every occupied cell individually and allocate the column value v, When the occupied cell is in the j” column of the row, which is such that the sum of the row and the columin values is equal to the unit cost value in the occupied cell, consider these values and pick other occupied cells ‘one by one and find the appropriate values of u,'s, taking in each ease , + ¥, = 6, Thus, if u is the row value of the i row, v, is the column value of the j” column and cy is the unit cost of the cell in the 1" row and ;* column, then the following equation gives the row and column values: uty Step 3: After finding all values of u, and v,, calculate for each unoccupied cell A= ¢, ~ (u, + ¥)). where 4,5 represent the opportunity costs of various cells. After calculating the opportunity costs follow the same process which is performed in the stepping stone method. The solution is called an optimal solution if all the empty cetls have positive opportunity. If values of A,'s are negative then the given solution is not an optimal solution and if one or more A,’'s values are negative ic., 4,<0, then choose the cell which has the largest opportunity cost Value and form a closed loop. According to the procedure of this method transfer the units along the route Test the result solution for optimality condition and improve if required. The process is repeated until an optimal solution is obtained. Hence the condition for the solution of being optimal solution is: ey - (a +) 20 Ques 32) Let consider the following table that shows manufacturing plants and warehouses of a comp: shipping costs to transport the available quantity (supply) from manufacturing plants A, B, C to req (demand) at every warehouses X, Y, Z and W. vem [Warehouse ethod, we have the following steps The initial step of stepping-stone method is to find the intial fe ferent methods that can be used for this, sueh ts Ans: After implementing the stepping stone ssible Step 1: Find-Out the Initial Feasible Solutic solution that satisfies the rim requirements. There are various diff 1) North-West Corner (NWC) Method, 2) Least Cost Method (LCM) and 3) Vogel's Approximation Method (VAM).D.80 BCA, Third Semester TP Solved Series (Operations Research-I) RTMNU. Applying VAM Method: After implementing the VAM, we have the following table: Warehouse Penalties Plant x | ¥ | z |W [suylt uo om A is |o 0 0 , a it ~- - 2 c 1 boat Demnd | 3 | 12 | 16 | 19 | 60 - 1 0 1 1 Penalties 1 - - it m | > & « ‘Transportation Costs = 15 x 2+ 12%2+ 1x 1242x144 x 1643x4= 304 24+ 12424644 12-144 ‘Step 2: Optimality Test: The transportation cost is now 7144. There are two methods that can be used for optimality test, ‘These are as below: 1) Stepping Stone Method and 2) MODI Method ‘dj Applying Stepping-Stone Method: Now let apply the stepping stone method ‘A+? “ ‘on the above example that has initial basic feasible solution obtained by VAM From the above table, itis known that there are six cells that are empty. These cells are: (A, X), (A, Y), (A, Z), (B, Z), (B, W) and (C, ¥). Let consider the non-occupied cell (A, X) for improvement. One unit shipping cost of an item fom this path result an increase of 83 and this will deduct one unit from the cell (¢, .W) (A, W) and hence there is decrease of 22 in the cost. In order to maintain the Oo as feasibility, let deduct one unit from the cell (C, X) and introduce one unit in the cell (C, W). The result of this process is that there is an increase of 22 in the Figure 3.1: Closed Loop cost. This is shown as below: Increment in cost after increasing one unit in cell (A,X) = +3 Decrement in cost after decreasing one unit in cell (A, W) =~ 2 Increment in cost after increasing one unit in cell (C, W) = +3 Decrement in cost after decreasing one unit in cell (C, X) 2 Total effect on the cost +2 Hence + sign indicates that there is an increase of cost of €2 per unt by taking the route AX. This also shows that there is a decrease of cost in this route is 82. Consider similar process for the empty cell (A, Z), then the cells (A, W), (C, Z) and (C, W) will form closed loop as shown in figure 3.1 In case one unit is moved from cell (A, W) to cell (A, Z) then the adjustments can be done in the cells (C, W) and (C, Z) in ‘such a manner that demand constraints is not violated. One unit transfer in this case will provide total effect on the cost = = 443 2 = 22, which show an increase in cost. This also shows per unit opportunity cost for cell (A, Z). Table 3.37 shows the opportunity costs for different empty cells of the solution to be calculated! _ ‘Table 3.37: Opportunity Cost [Cell | Loop Formed by the Celis Per Unit Change in Cost | Opportunity Cost (A.X) | (A.X)-(C.X) (CW) W) LC “| (AY) | (AY) 1B.) 18.2) (CZ) 4G W) 244 4e 3 [az [ADCO +CW)-A.W) S443 (BX) [BX CH+CH-B.H (BW) | BW) (BZ) +(C.2) (CW) (GY) (CZ +B, Z) (BY) odeansportation Problems (Unit 3) DBI (ne can find the opportunity cost by multiplying per unit alteration in cost by -1. From table 3.37, it is shown that the tunity cost for cell (B, X) is not less than zero. Hence solution is not optimal. Now consider another loop for the Suis. X) and (B, X). ‘Thenew solution is shown below: Initial Solution Warehouse Plant x x z w k 3 z 5 2 @ 1 | 4 4 . @ 3 7 c imality can be checked for this in order to calculate opportunity costs for all empty cells. In this case, opportunity costs for the cell (B, Z) will only be non-negative. The cell (B, X) will empty this cell atthe former iteration, Hence the optimal solution will be obtained with the minimum transportation cost of €144. If some cells have zero opportunity costs, while others are negative then this shows that solution is optimal. In such case the alternative optimal solution is also possible. Note: In case there are various cells that have negative cost, then choose that cell which shows the most negative cost Ques 33) Find the optimum solution of the following transportation problem using Least Cost/Matrix Minima Method and MODI method, where cells shows the transportation costs in rupees. [wv | wa [ws |W. | Supply o [el sa[ifs{ i o )s|9{|2/7] o |4[3lel2{ os Demand | 6 | 1 [5 | 4 ‘Ans: Afier implementing the least cost method, we got the final allocation table as below: Tw | Ws We Supply on 6s | 4 1 5 | Oo | | Os 4 Demand | 6 0 5 ‘ » | | Total Transportation Cost = 1x 144 8x6+9X9+2x1+3x1+2x5=14 +48 +81 42434 10-8158 Optimality Test Using MODI Method: Since the number of allocations (6) is equal to (m+n — 1) = 344 ~ 1 =6, hence the solution shows non-degeneracy. Now using the MODI method, find the u, and v,, y= u, + v; forall non-empty cells (i, )) Substituting, u) = 0, we get the following: -0=15 Uy yy 22u) +1 > uy =2- =1 Gy =u) +v) 38 8 Ga = uy + vy =p B= uy $B = WY =B-BH-S; Cy =U) HME ZE—SH Vg VyH PASAT Cy SU) + yy = 1 S04 vy 2 IF $y 28-15% uy + yp 9 9S bevy = v2 =9-ps2 BCA. Third Semester TP Solved Series (Operations Research-1) RTMNU We have following allocation table: ww] °o, 6 4 1 5 | w= © 1 16 6 WY s 5 4 is -0+7) 6-(-5+1 doz Since value of dy: 4 is most negative. Therefore loop starts from cell (O,, W;). We have the following table: wow Ww Ww Suppl | o 6 |@a o a a at oO 7 16 }— { © ‘ s@] 6 O| | wound | a os ~ Ls] 9-A=05A=9 Again find dy, dy y= 6-(0+7) or — (ui + ¥), for all empty cells (i, j), we have the following: =I dy =5-(043)=2 9-1 +4)=4 dy =7-(1+3) dy 24-147) = dy=6-(1-1)=6 We got the following table: Wi Ws | Wa _| Supply | | s yyw O ° 2 7 16 | wt Demand 6 wo | ois 4 a5‘Transporation Problems (Unit 3) since dy; = ~2 is most negative. We have the following loop: Wi ws Wi We [Sopp] ' 5 4 rol os 4 beat) — oq 2 , 6 Tosa 3 3 ‘ 2 5 aay Tat Demina | 6 0 5 + [os 1-a=0 asl Again we have following table: Supply o uw | uso o 6 | wet o 5 vemand| o | w | u.| 4 | 3 wat aed [Again find dy dy = cj ~ (u, +) forall empry cells (ij), we have the following 6)=6-0+7)=- du =3-+5)=0 du=9-(+4)=4 du=7-64D=1 =-3)=2 dy=6-(C3+1)=8 We have the following loop: f Ws W | W _| Suppiy hole | Oi fads 4 ata) o * 9 2 > | s-8) aes) o, & 3 6 © , | pemand | 6 10 5 a [os D-83BCA, Thisd Semester TP Solved Series (Operations Research-1) RTMNL 4-4 =0=>4 =4, After this we have following allocation table: De D D, [Ds | Supply | yl OO i la >| O,) 8 >| Os.) Ds ‘Again find d,, dy dy =1-+0)= 4 a cs dy =3-(244)=1 dy =6-(-2+0)=8 Since all values of 4, is positive (20). Therefore this solution is optimum. Hence Total Transportation Cost = 6 x44+8x1+4x144x104+2« 15+ 2¥4 = 2448444404 30+8= 2114 Ques 34) Following table gives the transportation cost in * from each warehouse to each market. L |e | @ |e [S| Supply ee Ee Warehouse |B |S) 9) 207) 18 ce [s[7|/si6| 8 | (Demana [7112 [17 9 | as Find optimal schedule and minimum transportation cost. (2016 [05]) ‘Ans: The shipping schedule determined by the clerk based on his experience is shown in table 3.38. c Demand ¥ ‘The total transportation cost associated with this solution is: 3xI2Z45K144x942K1S$5x7+8X1 Total cost 2150 Since the number of occupied cells (ie, 6) is equal to the required number of occupied cells (ie. m +n — 1) in a feasible solution, therefore solution is non-generate feasible solution. Now, 10 test the optimally of the solution given in Table 3.38 we evaluate each unoccupied cell in terms of the opportunity cost associated with itin the Usual manner as shown in table 3.39,sarspomtation Problems (UNC 32 bas table 3.39, cell (C. 5) has @ negative opportunity cost (i.e, -1). Thus, this solution is not the optimal solution and, Merefore, the schedule prepared by the shipping clerk is not optimal. rorming a closed loop to introduce the cell (C, S) into the new transportation schedule shown in table 3.16, the new Fe shows i ale 3.39 wad wed 5 While testing the optimality of the improved solution shown in table 3.40, we found that the opportunity « unoccupied cell are positive. Thus, the current solution is optimal und the optimal schedule is to transport 12 to Q; 2 units from A to R; 8 units from A to S; 15 units from B to R; 7 units from C to P and 1 unit from C to s. hninimum transportation cost associated with this solution is €149. Table 340 Supply] ws] 2 Ws3 s Ques 35) Consider the profit matrix as shown below: — jal ea lc] p! & J suppty L x | 19| a1 Jae | as] as | 180 vy 9 asl] a | 200 z (ww lw )u| | ns | Demand | s0 | 100 | 75 | 45 | 15 | Maximise the profit. Ans: As it is maximisation problem, we have to transform this problem into minimisation problem. For this, we have to subtract every element of matrix from the largest element (24) of the matrix as follows: [ a| B/C || & | Supply x |s{alsfofo | so ays fu fats ts z_\o{s slo, w] ns | [Denana an [10 a5 [a8 [as Here, total demand = 425 and total supply = 475. Since total demand is not equal to total supply, so it is an unbalanced problem. For balancing this problem, we have fo add dummy column with demand equal to 50D6. BCA. Thitd Semester TP Solved Series (Operations Research-1) RTMNU, After applying Vogel's approximation method, the initial solution of above problem will be as follows: A B c D E__| Dummy | Supply x Yes 9 9 0 150 25) 0) Y won 3 5 o 200 ,| Gs) O Owls is poms) wo | wo] | s | ms] @ | os Lo = ‘Since total allocation (8) is equal to (m +n ~ 1 = 3 + 6 — 1 = 8), so this problem is not degeneracy. For testing the ‘optimality of above initial solution, let apply the MODI method as follows: € D E | Dummy | Supply | x 8 9 9 0 10 | was y 1 zi 3 0 200 | wets rh z @ 8 10 0 5 | w=6 oe | Demand | 80 10 | 75 45 1s $0 475 yw =0 w= = -15 As the all opportunity costs are not zero or greater than zero, hence we have to drop the cell (Y, A) and ade the cell (YD) Hence the revised table is as below: F & ie g E @} B) w | ue ns | wel As all the opportunity costs are here > O, hence this solution is optimal ‘Total Profit 0x 5 + 1003 +25 x 5+ 125 x 13+ 50% 0430x6475 x4 +200 = 250-4 300+ 125 + 1625 + 0+ 180 + 300 +0 = 2780 Ques 36) What is Degeneracy in Transportation Problems? How resolve the degeneracy problem. ‘Ans: Degeneracy in Transportation Problems In transportation problem degeneracy arises if it satisfies the following condition Number of occupied cells < (Number of columns + number of rows ~ 1) Let the transportation problem consists of *m’ number of origins and ‘n’ numbers of destinations. Then its basic feasible solution is known as degenerate if Number of occupied cells < (m+n — 1)nsporation Problems (Unit 3) D7 enenally, degeneracy arises during the calculation of the initial basic feasible solution or during the testing of the optimal sion eh solution of Degeneracy in the Initial Stage: For resolving degeneracy, allocate a very small amount almost close o zero 10 one or more of the unoccupied cells which results in number of occupied cells equal to (m+n). For resolving degeneracy, one or more unoccupied cells are allocated by a small quantity ‘A’ (close to zero) and after performing this activity the occupied cells will become (m +n ~ 1). In a minimisation transportation problem, “A’ is allocated to that unoccupied cell which has lowest transportation cost and in a maximisation problem, ‘A’ is allocated to that cell which has higivest payoff value. In some cases, A must be added in one of those cells which uniquely identify the values of u, and v, 12) Resolution of Degeneracy during Sotution Stage: This is another method used to resolve degeneracy which arises during optimality test. In this method “A” is assigned to one or more cells which are recently vacated. Then the new solution consists of a number of occupied cells equal to (m +n ~ 1). Once the optimal solution is reached, it may be removed. Ques 37) A pharmaceutical company transports its medical equipment from source A, B, C to destinations X, Y, Z and W. The demand, supply and time of shipment are shown in the following table. Show how company will make transportation plan so that total cost for shipment is minimum? Destinations X[¥[Z[WI Supply x A [t[2lo|z2l 3 Soure |" B [as[20|12[ 8 | 13 ce [alefwlis[ a Demand | s [ur [8] 8 ‘Ans: Let apply the VAM method, we have the following table: Penalties x Y Zz Wo Supply 1 0 1 | A 10 2 2 8 jo - ® @ jos | mg 2 | os | on jean g F c a 2 10 is +} uo j2 3 6 Demand [5 n | 8 | 8 2 I Se 8 10T 7 6 81 a 7 mm 6 - = 7 Total Transportation Costs = 8 x0+5 x 1548x8411 x 12=0+75+ 64+ 132= 271 Test for Optimality using MODI Method Since the number of allocations (4) is not equal to (m +n ~ 1) =4+3~ = 6, hence solution is degenerate. , For eliminating degeneracy, we have to add small amount Ay and A, in the cell (A. X) and cell (C, Z) respectively. Hence ow total numbers of allocated cells has become equal to (m+n — 1),bss BCA, Third Semester 7P Solved Series (Operations Research-1) RTMNU. Let calculate the value of u, and y, for all occupied cells using the u. + ¥, yy We have following table: x oy zw Sm ela | Qs [a u 8 8 2 4 4=l0 y=2 a0 wy +) ~ (a, + ¥)) for all non-allocated cells. We get the following values: 62 — (Uy +) = 22-042) = 20; dig =e,g~ (uy +4) = 22-043) = 19 ex U2 + ¥2)=20-($ 2) = 13; dss =€35—(u; +5) = 12-(5 +0) =7 ey + Y= I= CO ID)= 1, dy es4— Cs # vs) = 1510-43) Since all values of dy > 0, hence it is an optimal solution. Total Transportation Cost = 8271