Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks

We consider minimum concave cost flow problems in acyclic, uncapacitated networks with a single source. For these problems a dynamic programming scheme is developed. It is shown that the concave cost functions on the arcs can be approximated by linear functions. Thus the considered problem can be solved by a series of linear programs. This approximation method, whose convergence is shown, works particularly well, if the nodes of the network have small degrees. Computational results on several classes of networks are reported.

[1]  Panos M. Pardalos,et al.  Algorithms for the single-source uncapacitated minimum concave-cost network flow problem , 1991, J. Glob. Optim..

[2]  James E. Falk,et al.  A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..

[3]  Patrick Rivett,et al.  Principles of Operations Research , 1972 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[5]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .

[6]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[7]  Panos M. Pardalos,et al.  A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem , 1997, Network Design: Connectivity and Facilities Location.

[8]  P. Pardalos,et al.  Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems , 2000, Networks.

[9]  Panos M. Pardalos,et al.  A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure , 1999, Oper. Res. Lett..

[10]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[11]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[12]  Bettina Klinz,et al.  Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost , 1993 .

[13]  Peter Värbrand,et al.  A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables , 1996, Math. Program..