Integration of a primal simplex network algorithm with a large-scale mathematical programming system

Authors:
J. A. Tomlin;J. S. Welch
Affiliations:
Ketron, Inc., Mountain View, CA;Ketron, Inc., Arlington, VA
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1985

Citing 2
Cited 1

Algorithms for Network Programming

Algorithms for Network Programming
Aspects of large-scale in-core linear programming

ACM '71 Proceedings of the 1971 26th annual conference

An improved primal simplex variant for pure processing networks

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

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.