Large scale mathematical programming systems

Abstract This survey covers the state of the art of large scale mathematical programming systems (MPS's) for solving problems which can be modeled using linear programming or its extensions, such as mixed integer and some types of nonlinear programming. Such models occur frequently in chemical engineering and in other types of process, manufacturing and distribution applications.

[1]  R. E. Griffith,et al.  A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems , 1961 .

[2]  James E. Kalan.  Aspects of large-scale in-core linear programming , 1971, ACM '71.

[3]  J. Tomlin.  Survey of computational methods for solving large scale systems , 1972, CDC 1972.

[4]  E. M. L. Beale.  Nonlinear Programming Using a General Mathematical Programming System , 1978 .

[5]  Michel Bénichou,et al.  The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results , 1977, Math. Program..

[6]  Robert Fourer,et al.  Solving staircase linear programs by the simplex method, 2: Pricing , 1983, Math. Program..

[7]  E.M.L. Beale,et al.  Branch and Bound Methods for Mathematical Programming Systems , 1977 .

[8]  Robert Fourer,et al.  Solving staircase linear programs by the simplex method, 1: Inversion , 1982, Math. Program..

[9]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[10]  John J. H. Forrest,et al.  Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .

[11]  F. Glover,et al.  The simplex SON algorithm for LP/embedded network problems , 1981 .

[12]  John A. Tomlin,et al.  Updated triangular factors of the basis to maintain sparsity in the product form simplex method , 1972, Math. Program..

[13]  Carlos Winkler,et al.  Basis Factorization for Block-Angular Linear Problems: Unified Theory of Partitioning and Decomposition using the Simplex Method , 1974 .

[14]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[15]  Darwin Klingman,et al.  Augmented Threaded Index Method for Network Optimization. , 1974 .

[16]  Michael J. Todd,et al.  Feature Article - The Ellipsoid Method: A Survey , 1981, Oper. Res..

[17]  Gerald G. Brown,et al.  Solving Generalized Networks , 1984 .

[18]  G. Dantzig,et al.  Large-scale linear programming : proceedings of a IIASA workshop, 2-6 June 1980 , 1981 .

[19]  John A. Tomlin,et al.  Formal optimization of some reduced linear programming problems , 1983, Math. Program..

[20]  Michael J. Todd,et al.  The Ellipsoid Method: A Survey , 1980 .

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

[22]  Paula M. J. Harris.  Pivot selection methods of the Devex LP code , 1973, Math. Program..

[23]  Richard D. McBride,et al.  The factorization approach to large-scale linear programming , 1976, Math. Program..

[24]  James K. Ho,et al.  An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming , 1981, Math. Program..