A review of the LU update in the simplex algorithm

Joseph M. Elble and Nikolaos V. Sahinidis

International Journal of Mathematics in Operational Research, 2012, vol. 4, issue 4, 366-399

Abstract: In the simplex method for linear optimisation, two linear systems involving a square non-singular basis matrix B and its transpose are solved at each iteration. A column of B is then replaced, and the solution of these two linear systems is required again. For the past four decades, researchers have made considerable advancements in updating the sparse LU factors of the basis matrix in this algorithm. This paper reviews the state-of-the-art in LU update procedures, while analysing each procedure to gain a full understanding of the progress made in this area.

Keywords: simplex algorithm; LU update; linear optimisation; matrix factorisation; computational stability; LU factorisation; LU decompostion. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=48901 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:4:y:2012:i:4:p:366-399

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().