Cunningham's Rule 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. Cunningham's Rule 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
The Bruun Rule tests of the theory and concluded that "the concept henceforth be known as "Bruun's Rule."""" Per Bruun has since published works to clarify the limitations and practicality of his model, including "Review of Conditions for Uses of the Bruun Rule of Erosion" in 1983, and "The Bruun Rule of Erosion by Sea-Level Rise: A Discussion on Large-Scale Two- and Three- Dimensional Usages" in 1988. These publications outline the rule's limitations and practicality and stress that, though this model is intentionally two dimensional, it is applied to three dimensional environments in practice. Bruun states that the rule "must be subjected to