Fortran subroutines for network flow optimization using an interior point algorithm

We describe Fortran subroutines for network flow optimization using an interior point network flow algorithm, that, together with a Fortran language driver, make up PDNET. The algorithm is described in detail and its implementation is outlined. Usage of the package is described and some computational experiments are reported. Source code for the software can be downloaded at http://www.research.att.com/~mgcr/pdnet.

[1]  Yinyu Ye,et al.  On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..

[2]  Quey-Jen Yeh,et al.  A reduced dual affine scaling algorithm for solving assignment and transportation problems , 1989 .

[3]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..

[4]  K. G. Ramakrishnan,et al.  Computational results of an interior point algorithm for large scale linear programming , 1991, Math. Program..

[5]  Mauricio G. C. Resende,et al.  An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks , 1993, SIAM J. Optim..

[6]  Donald Goldfarb,et al.  A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .

[7]  L. Portugal,et al.  A truncated primal‐infeasible dual‐feasible network interior point method , 2000 .

[8]  Sanjay Mehrotra,et al.  Finding an interior point in the optimal face of linear programs , 1993, Math. Program..

[9]  Clyde L. Monma,et al.  An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..

[10]  Joaquim Júdice,et al.  An Investigation of Interior-Point Algorithms for the Linear Transportation Problem , 1996, SIAM J. Sci. Comput..

[11]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[12]  Mauricio G. C. Resende,et al.  An Efficient Implementation of a Network Interior Point Method , 1991, Network Flows And Matching.