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

Robert Fourer

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

Robert Fourer^*

^*Corresponding author for this work

Industrial Engineering and Management Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Mathematical Programming
Pages	274-313
Number of pages	40
Edition	3
State	Published - Aug 1 1982

Publication series

Name	Mathematical Programming
Number	3
Volume	23

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@inproceedings{2b9b1178acd241ceb4689a8f1f1b1b37,

title = "SOLVING STAIRCASE LINEAR PROGRAMS BY THE SIMPLEX METHOD - 1. INVERSION.",

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.",

author = "Robert Fourer",

year = "1982",

month = aug,

day = "1",

language = "English (US)",

series = "Mathematical Programming",

number = "3",

pages = "274--313",

booktitle = "Mathematical Programming",

edition = "3",

}

TY - GEN

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

AU - Fourer, Robert

PY - 1982/8/1

Y1 - 1982/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020167734&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020167734&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0020167734

T3 - Mathematical Programming

SP - 274

EP - 313

BT - Mathematical Programming

ER -

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

Abstract

Publication series

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this