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

Authors

11

  1. NS
    Nikolaos Samaras

    University of Macedonia, Greece

    1 publications · 11 citations

    1

    h-index

  2. MC
    Mark Cave

    British Geological Survey, United Kingdom

    1 publications · 26 citations

    1

    h-index

  3. HN
    Hédi Nabli

    University of Sfax, Tunisia

    1 publications · 46 citations

    1

    h-index

  4. PT
    P. T. Bull

    Quick Reaction Corporation (United States), United States

    1 publications · 30 citations

    1

    h-index

  5. MF
    Mehrdad Farid

    Shiraz University, Iran

    1 publications · 26 citations

    1

    h-index

1–5 of 11

Venues

  1. Applied Mathematics and Computation

    1 publications · 46 citations

    1

    h-index

  2. Journal of Mechanisms and Robotics

    1 publications · 26 citations

    1

    h-index

  3. Analytica Chimica Acta

    1 publications · 26 citations

    1

    h-index

  4. Anaesthesia

    1 publications · 30 citations

    1

    h-index

  5. Yugoslav journal of operations research

    YUJOR · 1 publications · 11 citations

    1

    h-index

1–5