Study on Capacity Expansion Problem of Minimum Cost Flow

Abstract

Abstract. The minimum cost flow problem is the central object of study in the network flows. This paper studies capacity expansion problem of minimum cost flow. How to expand the network capacity effectively so that the network flow can reach a certain level with minimum total cost? In view of three types of expanding models: the arc-expanding model, the node-expanding model and the combination of arc-node expanding model; this article discusses the characteristics of the problems separately and a unified capacity expansion model is also proposed. Finally, an example has been provided in detail.