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
Equal authenticity rule be printed and published in both those Languages [i.e. both English and French]." The rule requires courts to treat "both [the English and French] versions of statutes [as] equally valid and authoritative interpretations of the law," The rule holds that both versions are equally authoritative even if the statute in question was clearly drafted in one language and translated into the other, and even if the two versions of the law are incompatible. An early version of the principle may be found a statute of the Parliament of the Province of Canada, enacted in 1857. The "Act respecting the Codification