Implementation aids for optimization algorithms that solve sequences of linear programs
- 1 December 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 12 (4), 307-323
- https://doi.org/10.1145/22721.22959
Abstract
We describe a collection of modules designed to facilitate the implementation of optimization (LP) algorithms that must solve one or more linear programs in a suitably coordinated sequence. Our collection also provides a basis for discussing some of the broader issues of LP software development and serves as a tutorial on state-of-the-art techniques that may be used to implement LP algorithms in a practical manner.Keywords
This publication has 14 references indexed in Scilit:
- Algorithms for stochastic programs: The case of nonstochastic tendersPublished by Springer Nature ,1986
- Stochastic Programming: Solution Techniques and Approximation SchemesPublished by Springer Nature ,1983
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- Large-scale linearly constrained optimizationMathematical Programming, 1978
- Pivot Selection TacticsPublished by Springer Nature ,1978
- A Tutorial on Matricial PackingPublished by Springer Nature ,1978
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977
- Pivot selection methods of the Devex LP codePublished by Springer Nature ,1975
- Nested decomposition for dynamic modelsMathematical Programming, 1974
- Reducing the retrieval time of scatter storage techniquesCommunications of the ACM, 1973