The simplex algorithm with the pivot rule of maximizing criterion improvement

37Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We extend a result of Klee and Minty by showing that the Simplex Algorithm with the pivot rule of maximizing criterion improvement is not a good algorithm in the sense of Edmonds. The method of proof extends to other similar pivot rules. © 1973.

Cite

CITATION STYLE

APA

Jeroslow, R. G. (1973). The simplex algorithm with the pivot rule of maximizing criterion improvement. Discrete Mathematics, 4(4), 367–377. https://doi.org/10.1016/0012-365X(73)90171-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free