Integration of a primal simplex network algorithm with a large-scale mathematical programming system
- 1 March 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 11 (1) , 1-11
- https://doi.org/10.1145/3147.3163
Abstract
In this paper we discuss the implementation of a primal simplex algorithm for network problems in the MPSIII mathematical programming system. Because of the need to interface with the rest of the MPS this implementation is unorthodox, but computationally effective, and has a number of advantages over “stand alone” network optimizers. It is argued that a similar approach is appropriate for other general-purpose mathematical programming systems, and has applications beyond pure network optimization.Keywords
This publication has 9 references indexed in Scilit:
- Formal optimization of some reduced linear programming problemsMathematical Programming, 1983
- Structural Redundancy in Large-Scale Optimization ModelsPublished by Springer Nature ,1983
- A Tutorial on Matricial PackingPublished by Springer Nature ,1978
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- The factorization approach to large-scale linear programmingMathematical Programming, 1976
- On pricing and backward transformation in linear programmingMathematical Programming, 1974
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974
- Updated triangular factors of the basis to maintain sparsity in the product form simplex methodMathematical Programming, 1972
- The Partitioned Preassigned Pivot Procedure (P4)Published by Springer Nature ,1972