<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>The traditional criss-cross algorithm for the linear programming problem is shown to be finite when <bold>s</bold>-monotone index selection rules are used. The set of <bold>s</bold>-monotone index selection rules, among others, include the Last In First Out (LIFO) and the Most Often Selected Variable rule (MOSV). The advantage of applying the <bold>s</bold>-monotone index selection rule is the flexibility it provides in selecting the pivot element while still preserving the guarantee for finiteness. Such flexibility may be used to improve the numerical stability of the algorithm.</p>
</abstract>

The traditional criss-cross algorithm for the linear programming problem is shown to be finite when s-monotone index selection rules are used. The set of s-monotone index selection rules, among others, include the Last In First Out (LIFO) and the Most Often Selected Variable rule (MOSV). The advantage of applying the s-monotone index selection rule is the flexibility it provides in selecting the pivot element while still preserving the guarantee for finiteness. Such flexibility may be used to improve the numerical stability of the algorithm.

Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules

Pure Mathematics and Applications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The traditional criss-cross algorithm for the linear programming problem is shown to be finite when s-monotone index selection rules are used. The set of...

Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules

Publié en ligne: 17 août 2022

Pages: 58 - 70

Reçu: 07 mars 2021

DOI: https://doi.org/10.1515/puma-2015-0041

Mots clés
Criss-cross method, index selection, finiteness

© 2022 Adrienn Csizmadia, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules

Publié en ligne: 17 août 2022

Pages: 58 - 70

Reçu: 07 mars 2021

DOI: https://doi.org/10.1515/puma-2015-0041

Mots clésCriss-cross method, index selection, finiteness

© 2022 Adrienn Csizmadia, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
Criss-cross method, index selection, finiteness