Maximum Difference Extreme Difference Method for Finding the Initial Basic Feasible Solution of Transportation Problems

A Transportation Problem can be modeled using Linear Programming to determine the best transportation schedule that will minimize the transportation cost. Solving a transportation problem requires finding the Initial Basic Feasible Solution (IBFS) before obtaining the optimal solution. We propose a new method for finding the IBFS called the Maximum Difference Extreme Difference Method (MDEDM) which yields an optimal or close to the optimal solution. We also investigate the computational time complexity of MDEDM, and show that it is O(mn)