Lowest Supply and Demand Method to Find Basic Feasible Solution of Transportation Problems

The Transportation Problem (TP) is a particular subclass of a linear programming problem.Economic and social activities are fostered by TP.In order to reduce the transportation cost (TC), we have demonstrated a novel method in this study for obtaining the basic feasible solution (BFS) to transportation problems."Lowest Supply and Demand (LSD) Method to Find Initial Basic Feasible Solutions of Transportation Problems" is the name of the suggested methodology.Many other strategies have been discussed for solving transportation problems, including Vogel's approximation method (VAM), row minima method (RMM), column minima method (CMM), north-west corner rule (NWCR), and matrix minima method (MMM).Numerical examples are used to compare the suggested method with the well-established method that is currently in use.Compared to the current methods, the suggested method finds the IFS to a transportation problem more quickly.The suggested approach is a compelling way to solve the problem.The investigation's LSD method appears to be simpler than other approaches, requiring less iteration to arrive at a feasible result.