Note: Solved example you find in video or in PDF When exactly one row or column is left, all the remaining variables are basic and are assigned the only feasible allocation.Allocate the maximum feasible amount to the first available non-crossed out element in the next column (or row).Adjust supply and demand for the non-crossed out rows and columns.If a row and column are satisfied simultaneously, cross only one out (it does not matter which). The remaining decision variables in that column (or row) are non-basic and are set equal to zero. If a column (or row) is satisfied, cross it out.the cell in the top left corner of the transportation tableau).
Allocate the maximum amount allowable by the supply and demand constraints to the variable x11 (i.e.Vogel’s approximation method (or Penalty method).Unbalance TP If total supply is not equal to total demand, then it balance with dummy source or destination.įinding an Initial Basic Feasible Solutions.
Stage I: Finding an initial basic feasible solution.Įxistence of Feasible Solution : A necessary and sufficient condition for the existence of a feasible solution to the general transportation problem is thatĮxistence of Basic Feasible Solution: The number of basic variables of the general transportation problem at any stage of feasible solution must be ( m + n – 1). Types of Transportation Problem in Operational Researchĭetails about balanced and unbalanced transportation problem you find in attached pdf notes at end of this article. The objective is to determine how much should be shipped from each source to each destination so as to minimise the total transportation cost. Since there is only one commodity, a destination can receive its demand from more than one source. The unit transportation cost of the commodity from each source to each destination. The level of supply at each source and the amount of demand at each destination.Ģ. These types of problems can be solved by general network methods, but here we use a specific transportation algorithm.ġ. factories) to a given number of destinations (e.g. 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.