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
Mischief rule they are interpreting. Driedger puts it this way: "[T]o this day, "Heydon's Case" is frequently cited. The courts still look for the 'mischief' and 'remedy', but now use what they find as aids to discover the meaning of what the legislature has said rather than to change it." Driedger goes on to argue that this modern use of the mischief rule ought to be understood as one of the components of what he characterized as the "modern" method of statutory construction, rather than a stand-alone rule serving (as it formerly had), as an alternative to the methods of construction proposed