Picture of scraped petri dish

Scrape below the surface of Strathprints...

Explore world class Open Access research by researchers at the University of Strathclyde, a leading technological university.


The s-monotone index selection rules for pivot algorithms of linear programming

Csizmadia, Zsolt and Illes, T. and Nagy, Adrienn (2012) The s-monotone index selection rules for pivot algorithms of linear programming. European Journal of Operational Research, 211 (3). 491–500. ISSN 0377-2217

ORR10_02.pdf - Draft Version

Download (475kB) | Preview


In this paper we introduce the concept of s-monotone index selection rule for linear programming problems. We show that several known anti-cycling pivot rules like the minimal index, Last-In–First-Out and the most-often-selected-variable pivot rules are s-monotone index selection rules. Furthermore, we show a possible way to define new s-monotone pivot rules. We prove that several known algorithms like the primal (dual) simplex, MBU-simplex algorithms and criss-cross algorithm with s-monotone pivot rules are finite methods. We implemented primal simplex and primal MBU-simplex algorithms, in MATLAB, using three s-monotone index selection rules, the minimal-index, the Last-In–First-Out (LIFO) and the Most-Often-Selected-Variable (MOSV) index selection rule. Numerical results demonstrate the viability of the above listed s-monotone index selection rules in the framework of pivot algorithms.