Two Marks Questions and Answers 1. Give the mathematical model for transportation problem. Solution: : Let ™m = number of sources 7 = number of destinations @; = supply at the source i bs = demand at the destination j ij = Cost of transportation per unit from source i to destination j ij = number of units to be transported from source ito destination j. Then the mathematical model, for the transportation problem is minimize: z = > Sea =I jaa Subject to: S25 d;,5=1t0n ia ij 20, i= 1to mand j=lton. 2. State and explain the types of transportation problems. Solution: Transportation problems can be classified into 2 types: (1) balanced transportation problems (2) unbalanced transportation problems A transportation problem is said to be balanced if 22% = 3b ja isl A transportation problem is said to be unbalanced if Sarde ja 3, State the types of techniques (methods) available to find initial basic feasible solutions in transportation . State the typ. problems. Solution: (i) North-West corner cell method(ii) Least cost cell method (iii) Vogel’s Approximation method/penalty «there fora balanced transportation problem with 3 roy, X, . How many basic variables (cells) will b 3 columns? Solution: m = number of rows = 3 n = number of columns = 3 Number of basic cells is = m-+n-1=3+3-1 : is it resolved? . What is meant by degeneracy in transportation problem? How 18 Solutic If the number of occupied cells is # m +n — 1, (where m destinations), then we say that there exists degeneracy. = number of sources and m = number To resolve degeneracy, we introduce a very small positive assignment (= 0) in suitable positions, ., that the number of occupied cells is = m+n — 1. . Define the following terms used in transportation model: (i) Feasible solution (ii) Basic Feasible solution (iii) Optimal solution (iv) Degenerate Basic Feasible solution (v) Non-degenerate Basic Feasible solution Solution: (@ A feasible solution to a transportation problem is a set of non-negative allocations a4; that satis fies the rim (row and column) restrictions. (ii) A feasible solution to a transportation problem is said to be a basic feasible solution if it contains no more than m +n — 1 non-negative allocations, where m = number of rows, n = number of columns of the transportation problem. ii) A feasible solution that minimizes the transportation cost (or) maximizes profit is called an op mal solution. (iv) A basic feasible solution in which the total number of i ions . non-negative ss than m+ n — Lis called degenerate basic feasible solution. eee: (v) A basic feasible solution to a (m x ; oa i aac eae (m x n) transportation problem is said to be non-degenerate it a) ¢ total number of non-1 i i i (b) these m +n—1 ibe near in ete Bexaelly mtn —1 ions are in independent positions, . What is meant by transshipment problem? What is its objective? e? Solution: nodes. Its objective isto minimize the total cost of ship ments.§, What are the classifications of assignment problems? Explain Solution: ‘The assignment (i) balanced assignment problems Gi) unbalanced assignment problems. If the number of rows (jobs) is equal to the number of columns (operators), then the problem is termed as a balanced assignment problem. Otherwise, it is called an assignment problem problem are classified into 49, What isthe main difference between assignment problem and Travelling salesman problem Solution: ‘Travelling salesman problem is very similar to the assignment problem except that in travelling sales- rman problem there is an additional restriction that a salesman who starts from his home city, visit each city only once and returns to his home city. 10. What are the main difference between the transportation problems and assignment problems? Solution: S.No. | Transportation Problem 1. | Supply at any source may be any positive ‘Assignment Problem ‘Supply at any source will be Tie., aj = 1 quantity a; %, | Demand at any destination may be any | Demand at any destination will be 1 i.e., positive quantity by bj =1 3, | One or more sources to any number of des- | One source to only one destination tinations II. State the necessary and sufficient condition for a transportation problem to have a solution Solution: ondition for a transportation problem to have a solution is j=l Necessary and sufficient i.e., Total supply = Total demand.