New variants of finite criss-cross pivot algorithms for linear programming

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

In this paper we generalize the so-called first-in-last-out pivot rule and the most-often-selected-variable pivot rule for the simplex method, as proposed in S. Zhang to the criss-cross pivot setting where neither the primal nor the dual feasibility is preserved. The finiteness of the new criss-cross pivot variants is proven.

Original languageEnglish (US)
Pages (from-to)607-614
Number of pages8
JournalEuropean Journal of Operational Research
Volume116
Issue number3
DOIs
StatePublished - Aug 1 1999

Fingerprint Dive into the research topics of 'New variants of finite criss-cross pivot algorithms for linear programming'. Together they form a unique fingerprint.

Cite this