Metraipolis › archive › dc_ed723cd05d76

Bland's rule — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bland%27s_rule
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T18:17:08.775Z
SHA-256 of the archived text
4a66a00b74ded5270bca8c1ac6bcb971ffc250744911937246d2e89a8cb4fe90
Stable URL of this page
https://metraipolis.com/documento/dc_ed723cd05d76

How to cite

Bland's rule — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bland%27s_rule (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ed723cd05d76 (Metraipolis archive dc_ed723cd05d76, sha256 4a66a00b74ded5270bca8c1ac6bcb971ffc250744911937246d2e89a8cb4fe90)
BibTeX
@misc{dced723cd05d76,
  title = {Bland's rule — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bland%27s_rule},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ed723cd05d76; sha256 4a66a00b74ded5270bca8c1ac6bcb971ffc250744911937246d2e89a8cb4fe90},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bland%27s_rule. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement of the simplex method for linear optimization. With Bland's rule, the simplex algorithm solves feasible linear optimization problems without cycling. The original simplex algorithm starts with an arbitrary basic feasible solution, and then changes the basis in order to decrease the minimization target and find an optimal solution. Usually, the target indeed decreases in every step, and thus after a bounded number of steps an optimal solution is found. However, there are examples of degenerate linear programs, on which the original simplex algorithm cycles forever. It gets stuck at a basic feasible solution (a corner of the feasible polytope) and changes bases in a cyclic way without decreasing the minimization target. Such cycles are avoided by Bland's rule for choosing a column to enter and a column to leave the basis. Bland's rule was developed by Robert G. Bland while he was a research fellow at the Center for Operations Research and Econometrics in Belgium.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Bland's rule» — https://en.wikipedia.org/wiki/Bland%27s_rule
Wikidata Q4924975 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4924975
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bland%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 1354163317, consultata il 2026-10-15T17:45:17.155Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: cfbcacca14329a51606ee352366adb17f531a73e9b03aae8370677730653d5db