Bland's rule

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematical optimization, Bland's rule (also known as Bland's algorithm or Bland's anti-cycling 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.[1][2][3] There are examples of degenerate linear optimization problems on which the original simplex algorithm would cycle forever. Such cycles are avoided by Bland's rule for choosing a column to enter the basis.

Bland's rule was developed by Robert G. Bland, now a professor of operations research at Cornell University, while he was a research fellow at the Center for Operations Research and Econometrics in Belgium.[1]


One uses Bland's rule during an iteration of the simplex method to decide first what column (known as the entering variable) and then row (known as the leaving variable) in the tableau to pivot on. Assuming that the problem is to minimize the objective function, the algorithm is loosely defined as follows:

  1. Choose the lowest-numbered (i.e., leftmost) nonbasic column with a negative (reduced) cost.
  2. Now among the rows choose the one with the lowest ratio between the (transformed) right hand side and the coefficient in the pivot tableau where the coefficient is greater than zero. If the minimum ratio is shared by several rows, choose the row with the lowest-numbered column (variable) basic in it.

Extensions to oriented matroids[edit]

In the abstract setting of oriented matroids, Bland's rule cycles on some examples. A restricted class of oriented matroids on which Bland's rule avoids cycling has been termed "Bland oriented matroids" by Jack Edmonds. Another pivoting rule, the criss-cross algorithm, avoids cycles on all oriented-matroid linear-programs.[4]


  1. ^ a b Bland (1977).
  2. ^ Christos H. Papadimitriou, Kenneth Steiglitz (1998-01-29). Combinatorial Optimization: Algorithms and Complexity. Dover Publications. pp. 53–55. 
  3. ^ Brown University - Department of Computer Science (2007-10-18). "Notes on the Simplex Algorithm" (PDF). Retrieved 2007-12-17. 
  4. ^ Fukuda, Komei; Terlaky, Tamás (1997). Thomas M. Liebling and Dominique de Werra, eds. "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming: Series B. Amsterdam: North-Holland Publishing Co. 79 (1–3): 369–395. MR 1464775. doi:10.1007/BF02614325. 

Further reading[edit]

  • Bland, Robert G. (May 1977). "New finite pivoting rules for the simplex method". Mathematics of Operations Research. 2 (2): 103–107. JSTOR 3689647. MR 459599. doi:10.1287/moor.2.2.103. 
  • George B. Dantzig and Mukund N. Thapa. 2003. Linear Programming 2: Theory and Extensions. Springer-Verlag.
  • Kattta G. Murty, Linear Programming, Wiley, 1983.
  • Evar D. Nering and Albert W. Tucker, 1993, Linear Programs and Related Problems, Academic Press.
  • M. Padberg, Linear Optimization and Extensions, Second Edition, Springer-Verlag, 1999.
  • Christos H. Papadimitriou and Kenneth Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Corrected republication with a new preface, Dover. (computer science)
  • Alexander Schrijver, Theory of Linear and Integer Programming. John Wiley & sons, 1998, ISBN 0-471-98232-6 (mathematical)
  • Michael J. Todd (February 2002). "The many facets of linear programming". Mathematical Programming. 91 (3): 417–436. doi:10.1007/s101070100261.  (Invited survey, from the International Symposium on Mathematical Programming.)