Algorithms for network piecewise-linear programs: A comparative study

Abstract Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

[1]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[2]  Robert Fourer,et al.  Solving Piecewise-Linear Programs: Experiments with a Simplex Approach , 1992, INFORMS J. Comput..

[3]  H. M. Merrill,et al.  Some applications of optimization techniques to power systems problems , 1974 .

[4]  George G. Polak,et al.  Network design and dynamic routing under queueing demand , 1985, Z. Oper. Research.

[5]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[6]  István Maros.  Performance Evaluation of the MINET Minimum Cost Netflow Solver , 1991, Network Flows And Matching.

[7]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[8]  István Maros.  A practical anti-degeneracy row selection technique in network linear programming , 1993, Ann. Oper. Res..

[9]  J. Taylor,et al.  Censored Observations in Randomized Block Experiments , 1959 .

[10]  C. L. Monma,et al.  A primal algorithm for finding minimum-cost flows in capacitated networks with applications , 1982, The Bell System Technical Journal.

[11]  L. Cooper,et al.  Stochastic transportation problems and other newtork related convex problems , 1977 .

[12]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy , 1988, Math. Program..

[13]  Stephen G. Nash,et al.  Guidelines for reporting results of computational experiments. Report of the ad hoc committee , 1991, Math. Program..

[14]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

[15]  Richard S. Barr,et al.  Network Reoptimization Algorithms: A Statistically Designed Comparison , 1993, INFORMS J. Comput..

[16]  Harvey J. Greenberg.  Computational Testing: Why, How and How Much , 1990, INFORMS J. Comput..

[17]  Anthony V. Fiacco,et al.  Mathematical programming study 21 , 1985, Mathematical programming.

[18]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[19]  Rema Padman,et al.  Dual Algorithms for Pure Network Problems , 1989, Oper. Res..

[20]  Jeffery L. Kennington,et al.  Solving the Pipe Network Analysis Problem Using Optimization Techniques , 1978 .

[21]  A. J. Germond,et al.  Network Simplex Method Applied to AC Load-Flow Calculation , 1987, IEEE Transactions on Power Systems.

[22]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming I: Derivation and proof , 1985, Math. Program..

[23]  John M. Mulvey,et al.  Reporting computational experiments in mathematical programming , 1978, Math. Program..

[24]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming III: Computational analysis and applications , 1992, Math. Program..

[25]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[26]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[27]  Michael Florian.  An improved linear approximation algorithm for the network equilibrium (packet switching) problem , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.