A TRANSPORTATION PROBLEM BASED ON LEAST COST METHOD AND VOGEL'S APPROXIMATION METHOD PROGRAMMING USING IN PYTHON

Abstract

This study focuses on the transportation problem, which seeks to reduces the total delivering stock and need requirements. Least Cost Method (LCM)

Identifiers the lowest cost transportation routes at the initial stage, whereas Vogel’s Approximation Method(VAM) determines penalty values for less efficient routes to obtain a better starting solution. These methods are implemented using Python to generate feasible allocations and compute the corresponding transportation costs. The results clearly present optimal allocations and total expenses. In addition, the research examines cost efficiency and discusses possible improvements through optimization techniques such as the MODI method. This analysis supports decision-making by helping practitioners evaluate alternatives before reaching the final optimal solution.