Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480059 | European Journal of Operational Research | 2012 | 10 Pages |
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.
► A new, general index selection scheme, the s-monotone rules are introduced. ► The scheme includes the LIFO and the MOSV rules as special cases. ► Several new index selection rules are suggested that are all s-monotone. ► Finiteness of the scheme is proven for the simplex and the MBU simplex algorithms. ► Numerical experiments are carried out using MATLAB implementations.