Implementation aids for optimization algorithms that solve sequences of linear programs

Authors:
J. L. Nazareth
Affiliations:
Computational Decision Support Systems, Berkeley, CA
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1986

Citing 7
Cited 1

A new polynomial-time algorithm for linear programming

Combinatorica
The Design of the XMP Linear Programming Library

ACM Transactions on Mathematical Software (TOMS)
Reducing the retrieval time of scatter storage techniques

Communications of the ACM
APL: An Interactive Approach

APL: An Interactive Approach
FORTRAN Codes for Mathematical Programming: Linear, Quadratic and Discrete

FORTRAN Codes for Mathematical Programming: Linear, Quadratic and Discrete
MPL, Mathematical Programming Language: specification manual for Committee review

MPL, Mathematical Programming Language: specification manual for Committee review
Two Subroutine Packages for the Efficient Updating of Matrix Factorizations

Two Subroutine Packages for the Efficient Updating of Matrix Factorizations

A primal null-space affine-scaling method

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

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.