On the need for a system optimization laboratory

Publisher Summary This chapter discusses the need for a system optimization laboratory. At present, it becomes necessary to create several system optimization laboratories where enough critical mass would exist that representative large-scale models could be practically modeled and numerically solved. The purpose of such a laboratory would be to support the development of computational methods and associated computer routines for the numerical analysis and optimization of large-scale systems. The ultimate objective of the development effort would be to provide an integrated set of computer routines for systems optimization that (1) is freely and publicly available to users of government, science, and industry, (2) is thoroughly practical and widely useful in applications to diverse kinds of large-scale systems optimization problems, (3) embodies the most powerful techniques of mathematical programming and numerical analysis, and (4) has been thoroughly tested for efficiency and effectiveness on representative systems optimization problems arising in practice. The chapter discusses the activities of system optimization laboratory. A major activity of system optimization laboratory would be the development of software packages for systems optimization. A major goal of the systems optimization laboratory would be to provide standardized computer routines for systems optimization. Large-scale optimization requires laboratories where a large number of test models, computer programs, and special tools to aid in developing variants of existing techniques are assembled in a systematic way. Only this way can one hope to model and solve the host of pressing total system problems that the world faces today.

[1]  Barry E Cushing.  The Application Potential of Integer Programming , 1970 .

[2]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[3]  G. Dantzig,et al.  Linear Programming in a Markov Chain , 1962 .

[4]  B. Curtis Eaves,et al.  Polymatrix Games with Joint Constraints , 1973 .

[5]  Herbert E. Scarf,et al.  The Approximation of Fixed Points of a Continuous Mapping , 1967 .

[6]  K. B. Haley,et al.  A General Method of Solution for Special Structure Linear Programmes , 1966 .

[7]  R. Cottle.  Note on a Fundamental Theorem in Quadratic Programming , 1964 .

[8]  George B. Dantzig,et al.  Optimal Solution of a Dynamic Leontief Model with Substitution , 1955 .

[9]  B. Eaves.  Computing Kakutani Fixed Points , 1971 .

[10]  M. Saunders.  Large-scale linear programming using the Cholesky factorization , 1972 .

[11]  B. Eaves.  On Quadratic Programming , 1971 .

[12]  B. Eaves.  The Linear Complementarity Problem , 1971 .

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

[14]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[15]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[16]  G. Dantzig.  UPPER BOUNDS, SECONDARY CONSTRAINTS, AND BLOCK TRIANGULARITY IN LINEAR PROGRAMMING , 1955 .

[17]  A. Williams,et al.  A Treatment of Transportation Problems by Decomposition , 1962 .

[18]  G. Dantzig.  ON THE SIGNIFICANCE OF SOLVING LINEAR PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES , 1960 .

[19]  T. Fabian,et al.  Decomposition, Pricing for Decentralization and External Economies , 1964 .

[20]  R. Cottle.  On a Problem in Linear Inequalities , 1968 .

[21]  Arthur F. Veinott,et al.  Polyhedral sets having a least element , 1972, Math. Program..

[22]  Richard W. Cottle.  Monotone solutions of the parametric linear complementarity problem , 1972, Math. Program..

[23]  C. Roger Glassey,et al.  Dynamic Linear Programs for Production Scheduling , 1971, Oper. Res..

[24]  H. Kuhn.  Simplicial approximation of fixed points. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Richaard W. Cottle.  Nonlinear Programs with Positively Bounded Jacobians , 1966 .

[26]  Pravin Varaiya,et al.  Decomposition of Large-Scale Systems , 1966 .

[27]  B. Eaves.  An odd theorem , 1970 .

[28]  Harvey M. Wagner,et al.  A Linear Programming Solution to Dynamic Leontief type Models , 1957 .

[29]  A. Heesterman,et al.  Special Simplex Algorithm for Linked Problems , 1965 .

[30]  H. Scarf.  The Core of an N Person Game , 1967 .

[31]  Arthur M. Geoffrion,et al.  Elements of Large-Scale Mathematical Programming Part I: Concepts , 1970 .

[32]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[33]  E. Beale,et al.  The Simplex Method Using Pseudo-Basic Variables for Structured Linear Programming Problems , 1961 .

[34]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[35]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

[36]  S. Karamardian.  The nonlinear complementarity problem with applications, part 1 , 1969 .

[37]  Frederick S. Hillier,et al.  Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..

[38]  G. Dantzig,et al.  GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I , 1964 .

[39]  John M. Bennett,et al.  An Approach to Some Structured Linear Programming Problems , 1966, Oper. Res..

[40]  G. Dantzig.  COMPACT BASIS TRIANGULARIZATION FOR THE SIMPLEX METHOD , 1962 .

[41]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[42]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[43]  Robert Wilson,et al.  Computing Equilibria of N-Person Games , 1971 .

[44]  Egon Balas,et al.  An Infeasibility-Pricing Decomposition Method for Linear Programs , 1966, Oper. Res..

[45]  G. Dantzig.  Linear Control Processes and Mathematical Programming , 1966 .

[46]  R. Bartels.  A stabilization of the simplex method , 1971 .

[47]  S. Vajda.  Décomposition des Programmes Mathématiques , 1968 .

[48]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[49]  D. R. Fulkerson.  Flow Networks and Combinatorial Operations Research , 1966 .

[50]  Donald J Rose,et al.  Sparse Matrices and their Applications Proceedings of a Symposium on Sparse Matrices and Their Applications, held September 9-10, 1971, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, , 1972 .

[51]  G. Dantzig,et al.  COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[52]  R. Wets,et al.  Programming under Uncertainty and Stochastic Optimal Control , 1966 .

[53]  Salah E. Elmaghraby,et al.  The Theory of Networks and Management Science: Part II , 1970 .

[54]  D. Gale.  On Optimal Development in a Multi-Sector Economy , 1967 .

[55]  J. B. Rosen.  Primal partition programming for block diagonal matrices , 1964 .

[56]  G. Dantzig,et al.  Programming of Interdependent Activities: I General Discussion , 1949 .

[57]  B. Curtis Eaves,et al.  On the basic theorem of complementarity , 1971, Math. Program..

[58]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

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

[60]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points , 1972, Math. Program..

[61]  Frederick S. Hillier.  A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables , 1969, Oper. Res..

[62]  J. Rosenmüller.  On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games , 1971 .

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

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