A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Pivot rules for linear programming: A survey on recent theoretical developments
1993
Annals of Operations Research
The purpose of this paper is to discuss the various pivot rules of the simplex method and its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with finiteness properties of simplex type pivot rules. Well known classical results concerning the simplex method are not considered in this survey, but the connection between the new pivot methods and the classical ones are discussed if there is any. In
doi:10.1007/bf02096264
fatcat:foj3h7ql6bavddvblb5pg4u4fu