2005
DOI: 10.1016/j.ejor.2003.06.048
|View full text |Cite
|
Sign up to set email alerts
|

Phase I cycling under the most-obtuse-angle pivot rule

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 33 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…In other words, cycling can only occur in full iterations. This algorithm belong to the class of 'infinite' algorithms, since the possibility of cycling cannot be ruled out theoretically at present; in fact, a cycling example has been recently given by Cuerrero-Garcfa and SantosPalomo [11] in the classical context. From a practical point of view, finiteness is not a serious problem: first, it is well known that computational performance of existing 'finite' simplex variants is unsatisfactory whereas successful simplex variants are actually 'infinite', such as Dantzig's conventional simplex method.…”
Section: Comments On the Pivoting Rulementioning
confidence: 97%
“…In other words, cycling can only occur in full iterations. This algorithm belong to the class of 'infinite' algorithms, since the possibility of cycling cannot be ruled out theoretically at present; in fact, a cycling example has been recently given by Cuerrero-Garcfa and SantosPalomo [11] in the classical context. From a practical point of view, finiteness is not a serious problem: first, it is well known that computational performance of existing 'finite' simplex variants is unsatisfactory whereas successful simplex variants are actually 'infinite', such as Dantzig's conventional simplex method.…”
Section: Comments On the Pivoting Rulementioning
confidence: 97%