<![CDATA[This research introduces a unified mathematical framework connecting three classical transportation problem methods Northwest Corner Rule (NWC), Modified Distribution Method (MODI), and the Stepping Stone Method to the modern theory of Optimal Transport (OT). Despite their long-standing use in operations research, these classical algorithms have traditionally been treated as heuristic procedures without a formal theoretical link to the rigorous Monge Kantorovich formulation. This study demonstrates that each method corresponds directly to fundamental geometric and dual structures of the transportation polytope: NWC generates an initial extreme-point solution, MODI computes dual potentials analogous to Kantorovich potentials, and Stepping Stone identifies improvement cycles consistent with movements along polytope edges. Using formal definitions, algebraic mappings, and geometric interpretation, the research establishes a coherent connection between classical OR algorithms and OT duality theory. The results show that these methods are not isolated heuristics, but structured approximations of optimal transport processes. The unified framework improves theoretical understanding, simplifies instructional explanations, and offers methodological insights that may support future algorithmic enhancements. Limitations include scalability challenges and reduced applicability to complex continuous OT settings. Overall, this research contributes a foundational unification that bridges classical transportation algorithms with contemporary optimal transport theory, advancing both theoretical rigor and practical comprehension.]]>
Copyrights © 2025
