Result: The optimal solution: Conclusion: it is optimal to ship 100 units from Factory 1 to Customer 2, 100 units from Factory 2 to Customer 2, 100 units from Factory 2 to Customer 3, 200 units from Factory 3 to Customer 1 and 100 units from Factory 3 to Customer 3.
Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. Again, some of the well reputed methods for finding an initial basic feasible solution of transportation problems developed and discussed by them are North West Corner Method (NWCM)  , Row Minimum Method (RMM)   , Column Minimum Method (CMM)   , Least Cost Method (LCM)  , Vogel’s Approximation Method (VAM)   , Extremum Difference Method (EDM)  , Highest Cost Difference Method (HCDM)   , Average Cost Method (ACM)  , TOCM-MMM Approach  , TOCM-VAM Approach  , TOCM-EDM Approach  , TOCM-HCDM Approach  , TOCM-SUM Approach  etc.
Received 24 November 2015; accepted 1 March 2016; published 4 March 2016 1. There are m sources and n destinations, each represented by a node. The objective function minimizes the total cost of transportation (Z) between various sources and destinations. (2014) Advanced Vogel’s Approximation Method (AVAM): A New Approach to Determine Penalty Cost for Better Feasible Solution of Transportation Problem.
Introduction Transportation problem is famous in operation research for its wide application in real life. The arcs represent the routes linking the sources and destinations. The constraint i in the first set of constraints ensures that the total units transported from the source i is less than or equal to its supply. International Journal of Engineering Research & Technology (IJERT), 3, 182-187.
Solve Transportation Problem Essay Questions In American History