The long step rule in the bounded-variable dual simplex method: Numerical experiments

Ekaterina Kostina

Mathematical Methods of Operations Research, 2002, vol. 55, issue 3, 413-429

Abstract: The dual simplex algorithm is the method of choice when linear programs have to be reoptimized after adding constraints or fixing variables. In this paper we discuss a modication of the standard dual simplex which allows for taking longer steps when proceeding from one dual feasible solution to the other. We describe this long step rule and present computational results on NETLIB and MIPLIB problems. Copyright Springer-Verlag Berlin Heidelberg 2002

Keywords: Key words: Linear Programming; Dual Simplex Method (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200188 (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:spr:mathme:v:55:y:2002:i:3:p:413-429

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200188

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().