A Modified Method for Finding the Initial Basic Feasible Solution of Transportation Problems

Student: Abbas Ibrahim Umar (Project, 2025)
Department of Mathematical Sciences
Bayero University, Kano, Kano State

Abstract

The transportation problem, a vital component of linear programming, addresses the optimal allocation of resources from multiple sources to various destinations at minimal cost. The effectiveness of any solution method greatly depends on the quality of the Initial Basic Feasible Solution (INBFS), which serves as a starting point for iterative optimization methods like the Modified Distribution Method (MODI). This project presents a modified approach for obtaining the INBFS of transportation problems, aimed at improving convergence to the optimal solution and computational efficiency. The proposed method is evaluated in comparison with established techniques, including the Allocation Table Method, Vogel’s Approximation Method (VAM), and the Equitable Allocation Method (EQM). The results demonstrate that the modified method consistently provides a closer approximation to the optimal solution, thereby enhancing overall efficiency in solving transportation problems

Keywords
modified method finding initial basic feasible solution transportation problems
Filters
Institutions