Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index... AbstractThe 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pure Mathematics and Applications de Gruyter

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

Csizmadia, Adrienn
Pure Mathematics and Applications , Volume 30 (2): 13 – Aug 1, 2022
Download PDF
13 pages

Loading next page...
 
/lp/de-gruyter/finiteness-of-the-criss-cross-algorithm-for-the-linear-programming-6JimeNOfik
Publisher
de Gruyter
Copyright
© 2022 Adrienn Csizmadia, published by Sciendo
eISSN
1788-800X
DOI
10.1515/puma-2015-0041
Publisher site
See Article on Publisher Site

Abstract

AbstractThe 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.

Journal

Pure Mathematics and Applications – de Gruyter

Published: Aug 1, 2022

Keywords: Criss-cross method; index selection; finiteness; 90C49; 90C05

There are no references for this article.