A Status Report on Computing Algorithms for Mathematical Programming

The development of mathematical programming solution techniques has proceeded hand in hand with developments in computer technology, and many computer codes for mathematical programming are in use today. This report examines some of the computational aspects of mathematical programming, surveying the current state of the art. Since linear programming has developed the farthest, computations in this area are examined in more detail than computations in other areas. For linear programming, the principal features of modern linear programming systems are covered, along with other implementations and extension areas For other areas of mathematical programming, a genera] status report on computations is presented.

[1]  A. Land,et al.  An Inverse-Basis Method for Beale's Quadratic Programming Algorithm , 1973 .

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

[3]  Eli Hellerman,et al.  Reinversion with the preassigned pivot procedure , 1971, Math. Program..

[4]  J. D. Pearson.  Variable metric methods of minimisation , 1969, Comput. J..

[5]  Åke Björck,et al.  Numerical Methods , 2021, Markov Renewal and Piecewise Deterministic Processes.

[6]  S. Vajda.  Recent Advances in Mathematical Programming , 1964 .

[7]  J. Reid.  Large Sparse Sets of Linear Equations , 1973 .

[8]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[9]  George B Dantzig,et al.  GENERALIZED UPPER BOUNDING TECHNIQUES FOR LINEAR PROGRAMMING, 2 , 1965 .

[10]  P. Wolfe.  The Composite Simplex Algorithm , 1965 .

[11]  George B. Dantzig,et al.  Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[12]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[13]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[14]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

[15]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[16]  J. Tomlin.  Maintaining a sparse inverse in the simplex method , 1972 .

[17]  Carl August Zehnder,et al.  Numerical methods of mathematical optimization , 1971 .

[18]  J. Tomlin.  Pivoting for Size and Sparsity in Linear Programming Inversion Routes , 1972 .

[19]  A. Booth.  Numerical Methods , 1957, Nature.

[20]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[21]  S. L. Cook.  Purposes and Quality of Graduate Education in the Management Sciences , 1970 .

[22]  R. Willoughby.  Sparse matrices and their applications , 1972 .

[23]  B. P. Dzielinski,et al.  Optimal Programming of Lot Sizes, Inventory and Labor Allocations , 1965 .

[24]  D. Goldfarb,et al.  Conjugate Gradient Method for Nonlinear Programming Problems with Linear Constraints , 1968 .

[25]  R. Gomory,et al.  A Primal Method for the Assignment and Transportation Problems , 1964 .

[26]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[27]  E. M. L. Beale,et al.  Mathematical programming in practice , 1968 .

[28]  R. Bellman.  Dynamic programming. , 1957, Science.

[29]  Arthur M. Geoffrion,et al.  Elements of large-scale mathematical programming , 1969 .

[30]  P. Gill,et al.  A numerically stable form of the simplex algorithm , 1973 .

[31]  Gene H. Golub,et al.  The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.

[32]  H GolubGene,et al.  The simplex method of linear programming using LU decomposition , 1969 .

[33]  Joseph J. Moder,et al.  Project Management with CPM and PERT , 1964 .

[34]  L. J. Larsen.  A modified inversion procedure for product form of the inverse linear programming codes , 1962, CACM.

[35]  J. Tomlin.  Modifying Triangular Factors of the Basis in the Simplex Method , 1972 .

[36]  M. D. Grigoriadis,et al.  Experimental implementations of mixed integer programming algorithms , 1971, ACM '71.

[37]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[38]  B. V. Shah,et al.  Integer and Nonlinear Programming , 1971 .

[39]  J. D. Pearson.  ON VARIABLE METRIC METHODS OF MINIMIZATION , 1968 .

[40]  R. P. Harvey,et al.  SPARSE MATRIX TECHNIQUES IN TWO MATHEMATICAL PROGRAMMING CODES , 1969 .

[41]  Anthony V. Fiacco,et al.  Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming , 1964 .

[42]  J. J. Lagemann,et al.  A method for solving the transportation problem , 1967 .

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

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

[45]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[46]  D. R. Fulkerson,et al.  Flows in Networks , 1963 .

[47]  T. A. Bray,et al.  Algorithms: Algorithm 336: netflow , 1968, CACM.

[48]  M. Rusin,et al.  A Revised Simplex Method for Quadratic Programming , 1971 .

[49]  Jack B. Dennis,et al.  A High-Speed Computer Technique for the Transportation Problem , 1958, JACM.

[50]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[51]  Hans P. Künzi,et al.  ALGOL AND FORTRAN PROGRAMS , 1971 .

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

[53]  M. Grigoriadis,et al.  A Treatment of Transportation Problems by Primal Partition Programming , 1968 .

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