Maintaining a sparse inverse in the simplex method

Authors:
J. A. Tomlin
Affiliations:
Operations Research Department, Stanford University, Stanford, CaIifornia
Venue:
IBM Journal of Research and Development
Year:
1972

Citing 2
Cited 1

The simplex method of linear programming using LU decomposition

Communications of the ACM
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

George B. Dantzig and systems optimization

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several low-order numerical solutions of stiff systems of ordinary differential equations are computed by repeated integration, using a multistep formula with parameters. By forming suitable linear combinations of such solutions, higher-order solutions ...