Such a solution is called degenerate solution. b. the solution so obtained is not feasible. Degeneracy in the solution of a Transportation : When the number of occupied cells in the solution of a Transportation Problem becomes less than m + n - 1 [where m = number of row and n = number of columns], the solution is known as a degenerate solution. d) identify the relevant costs in a transportation problem) Answer : b. assist one in moving from an initial feasible solution to the optimal solution 26) The purpose of a dummy source or dummy destination in a transportation problem is to a) prevent the solution from becoming degenerate) b) obtain a balance between total supply and total . Journal of the Operational Research Society: Vol. The transportation problem in operational research is concerned with finding the minimum cost of transporting a single commodity from a given number of sources (e.g. Because of the intractability of carrying out massive calculations in transportation problem solution procedure without a soft computing program, thirteen . The optimal solution is obtained either by using stepping stone method or by MODI method in the second phase. In a transportation problem, a dummy source is given a zero cost, while in an assignment problem, a dummy source is given a very high cost. OPERATIONS RESEARCH (MCQS) - Study For Buddies Module 4.ppt - Module 4 Transportation Problem 1... modi method in transportation problem ppt In a transportation problem with m origins and n destinations, if a basic feasible solution has less than m + n - 1 allocations (occupied cells), the problem is said to be a degenerate transportation problem. The degeneracy in the transportation problem indicates that (a) Dummy allocation needs to be added (b) The problem has no feasible solution (c) The multiple optimal solution exists. To resolve degeneracy which occurs during optimality test, the quantity may be allocated to one or more cells which have become unoccupied recently to have m + n -1 member of occupied cells in the new solution. The first phase is finding the initial basic feasible solution by using various methods. The above transportation problem can be written in the following tabular form: Now the linear programming model representing the transportation problem is given by . The method is a modification of the already-known Modified Distribution (MODI) method and consists in proceeding with the non-zero cells of the basis and a dual solution corresponding to these cells-without attempting to complete the basis.
Rückfallprophylaxe Sucht Arbeitsblätter, Articles D