The apex systems past and future
- 1 April 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMAP Bulletin
- No. 29,p. 3-23
- https://doi.org/10.1145/1111257.1111259
Abstract
A number of features of the APEX-I and/or APEX-III Mathematical Programming Systems that were novel when they were introduced are discussed. These include the use of supersparsity, a numerically stable variant of the Hellerman-Rarick invert, some extensions to matrix reduction algorithms new and methods of model analysis. There is a short discussion of development methodology and overall data structure in the systems. Finally a short discussion of some promising areas of future development is presented.Keywords
This publication has 6 references indexed in Scilit:
- Data Structures and Computer Science Techniques in Operations ResearchOperations Research, 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
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975
- Reinversion with the preassigned pivot procedureMathematical Programming, 1971
- Aspects of large-scale in-core linear programmingPublished by Association for Computing Machinery (ACM) ,1971