Bland's Rule
Bland's Rule is a pivot selection rule in linear programming that belongs to the class of deterministic algorithms for resolving degeneracy in the simplex method, distinguished by its use of the smallest-indexed variable to enter and leave the basis, thereby preventing cycling and guaranteeing termination.
5
Publications
139
Citations
11
Authors
6
Institutions
Publications per year
2017–2026
0
Variants
Bland's Pivot Rule
Parents
5
An overview on the simplex algorithm
Hédi Nabli · Applied Mathematics and Computation · 2009 · 46 citations
Accidental intrapulmonary Clinifeed
P. Harvey, P. T. Bull, David L. Harris · Anaesthesia · 1981 · 30 citations · Full text
Comparison of simplex algorithms
Lloyd R. Parker, Mark Cave, Ramón M. Barnes · Analytica Chimica Acta · 1985 · 26 citations
1–5 of 5
11
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 11
6
University of Sfax
Sfax, Tunisia
1 h-index
1 publications
46 citations

University of Macedonia
Thessaloniki, Greece
1 h-index
1 publications
11 citations

Bristol Royal Infirmary
Bristol, United Kingdom
1 h-index
1 publications
30 citations

Shiraz University
Shiraz, Iran
1 h-index
3 publications
78 citations

Royal Navy
London, United Kingdom
1 h-index
3 publications
90 citations

University of Massachusetts Amherst
Amherst Center, United States
1 h-index
3 publications
78 citations

University of Otago
Dunedin, New Zealand
1 publications
10 citations
1–7 of 6
1 publications · 46 citations
1
h-index
1 publications · 26 citations
1
h-index
1 publications · 26 citations
1
h-index
1 publications · 30 citations
1
h-index
YUJOR · 1 publications · 11 citations
1
h-index
1–5