Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
Illés, Tibor and Nagy, Adrienn (2014) Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules. Optimization, 63 (1). pp. 49-66. ISSN 0233-1934 (https://doi.org/10.1080/02331934.2013.811666)
Full text not available in this repository.Request a copyAbstract
Several variations of index selection rules for simplex-type algorithms for linear programming, like the Last-In-First-Out or the Most-Often-Selected-Variable are rules not only theoretically finite, but also provide significant flexibility in choosing a pivot element. Based on an implementation of the primal simplex and the monotonic build-up (MBU) simplex method, the practical benefit of the flexibility of these anti-cycling pivot rules is evaluated using public benchmark LP test sets. Our results also provide numerical evidence that the MBU-simplex algorithm is a viable alternative to the traditional simplex algorithm.
ORCID iDs
Illés, Tibor
-
-
Item type: Article ID code: 51623 Dates: DateEvent1 January 2014Published18 July 2013Published Online21 May 2013AcceptedSubjects: Science > Mathematics > Electronic computers. Computer science Department: Strathclyde Business School > Management Science Depositing user: Pure Administrator Date deposited: 12 Feb 2015 12:55 Last modified: 01 Feb 2025 03:28 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/51623