SOLVING STAIRCASE LINEAR PROGRAMS BY THE SIMPLEX METHOD - 1. INVERSION.

Robert Fourer*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

This and a companion paper consider how current implementations of the simplex method may be adapted to better solve linear programs that have a staged, or ″staircase″ , structure. This paper looks at ″inversion″ routines within the simplex method, particularly those for sparse triangular factorization of a basis by Gaussian elimination and for solution of triangular linear systems. Extensive (though preliminary) computational experience is described.

Original languageEnglish (US)
Title of host publicationMathematical Programming
Pages274-313
Number of pages40
Edition3
StatePublished - Aug 1 1982

Publication series

NameMathematical Programming
Number3
Volume23

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'SOLVING STAIRCASE LINEAR PROGRAMS BY THE SIMPLEX METHOD - 1. INVERSION.'. Together they form a unique fingerprint.

Cite this