Metraipolis › archive › dc_4c352ed175eb
Cunningham's rule — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Cunningham%27s_rule
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:41:19.439Z
- SHA-256 of the archived text
396b41c6f5c8ebf9589200c5dbcdccbc80f8d10ea787f406ef3880042a77a25f- Stable URL of this page
https://metraipolis.com/documento/dc_4c352ed175eb
How to cite
Cunningham's rule — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Cunningham%27s_rule (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4c352ed175eb (Metraipolis archive dc_4c352ed175eb, sha256 396b41c6f5c8ebf9589200c5dbcdccbc80f8d10ea787f406ef3880042a77a25f)
BibTeX
@misc{dc4c352ed175eb,
title = {Cunningham's rule — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Cunningham%27s_rule},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4c352ed175eb; sha256 396b41c6f5c8ebf9589200c5dbcdccbc80f8d10ea787f406ef3880042a77a25f},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Cunningham%27s_rule. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematical optimization, Cunningham's rule (also known as least recently considered rule or round-robin rule) is an algorithmic refinement of the simplex method for linear optimization. The rule was proposed 1979 by W. H. Cunningham to defeat the deformed hypercube constructions by Klee and Minty et al. (see, e.g. Klee–Minty cube). Cunningham's rule assigns a cyclic order to the variables and remembers the last variable to enter the basis. The next entering variable is chosen to be the first allowable candidate starting from the last chosen variable and following the given circular order. History-based rules defeat the deformed hypercube constructions because they tend to average out how many times a variable pivots. It has recently been shown by David Avis and Oliver Friedmann that there is a family of linear programs on which the simplex algorithm equipped with Cunningham's rule requires exponential time. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Cunningham's rule» — https://en.wikipedia.org/wiki/Cunningham%27s_rule Wikidata Q49000596 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q49000596 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Cunningham%27s_rule?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1348566349, consultata il 2026-10-07T22:17:20.075Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b2a5d9b2f5fb8398f9e468558b44876618283293876aff1329355497f03a0c76