A set of pivot rules, the application of which to linear-programming (degenerate) problems, prevents cycling in the simplex algorithm. Their basic principle is that whenever there is more than one eligible candidate in selection of the variable entering the basis, or the variable leaving the basis, the candidate with the smallest index is chosen. Anticycling rules; Cycling; Degeneracy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). BLAND'S ANTICYCLING RULES . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_78
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_78
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive