A Comparative Study of Solving Methods of Transportation Problem in Linear Programming Problem

The paper is related with the basic transportation problem (TP)which is one kind of linear programming problem (LPP). There are some existing methods for solving transportation problem and in this paper all the standard existing methods has been discussed to understand which one is the best method among them. Among all of existing methods, the Vogel’s Approximation Method (VAM) is considered the best method which gives the better optimal result then other methods and North-West Corner Rule is considered as simplest but gives worst result. A C programming code for Vogel’s Approximation Method have been added in the appendix.