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 language||English (US)|
|Title of host publication||Mathematical Programming|
|Number of pages||40|
|State||Published - Aug 1 1982|
ASJC Scopus subject areas