Basis Inverse and Update Methods

Nikolaos Ploskas and Nikolaos Samaras
Additional contact information
Nikolaos Ploskas: University of Macedonia
Nikolaos Samaras: University of Macedonia

Chapter Chapter 7 in Linear Programming Using MATLAB®, 2017, pp 303-328 from Springer

Abstract: Abstract The computation of the basis inverse is the most time-consuming step in simplex-type algorithms. The basis inverse does not have to be computed from scratch at each iteration, but updating schemes can be applied to accelerate this calculation. This chapter presents two basis inverse and two basis update methods used in simplex-type algorithms: (i) Gauss-Jordan elimination basis inverse method, (ii) LU Decomposition basis inverse method, (iii) Product Form of the Inverse basis update method, and (iv) Modification of the Product Form of the Inverse basis update method. Each technique is presented with: (i) its mathematical formulation, (ii) a thorough numerical example, and (iii) its implementation in MATLAB. Finally, a computational study is performed. The aim of the computational study is to compare the execution time of the basis inverse and update methods and highlight the significance of the choice of the basis update method on simplex-type algorithms and the reduction that it can offer to the solution time.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:spochp:978-3-319-65919-0_7

Ordering information: This item can be ordered from
http://www.springer.com/9783319659190

DOI: 10.1007/978-3-319-65919-0_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().