Research indexThesis
MINIMUM COST NETWORK FLOW PROBLEM AND NETWORK SIMPLEX METHOD
Zeleke
23 May 2026Open access
NobleIDark:/48914/w1/20261105/34735AFFDOI10.20372/nadre:24939
MINIMUM COST NETWORK FLOW PROBLEM AND NETWORK SIMPLEX METHOD
Zeleke · 2026
NobleIDark:/48914/w1/20261105/34735AFFDOI10.20372/nadre:24939
Free to read at the publisher
You can read the abstract here, or the full text at the publisher.
Abstract
A basic optimization model in operations research, the Minimum Cost Flow (MCF) issue has several applications in logistics, energy systems, transportation, and telecommunications. Finding the most economical method of moving flow across a network while meeting capacity, supply, and demand restrictions is its goal. Special instances including shortest path, assignment, maximum flow, transportation, and transshipment issues are all covered by this flexible approach. General-purpose linear programming is frequently used in traditional solution techniques, although these methods become computationally intensive for large-scale networks. In order to overcome this difficulty, a modified version of the simplex method called the Network Simplex Method (NSM) takes advantage of network structure to increase efficiency. NSM offers a theoretically beautiful and practically useful solution framework by preserving feasibility through spanning tree solutions and repeatedly improving the goal function. In order to show the theoretical relevance and practical usefulness of NSM in the context of optimization, this paper formulates the MCF theoretically, examines current solution methods, and applies NSM to actual issues. Key Word: - Network Simplex Method, Efficiency of Network Simplex Method, Minimum Cost Flow Network Problem