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 languages [sic] versions of a statute are enacted simultaneously both versions will be considered equally authoritative." Equal authenticity rule The equal authenticity rule is a rule of judicial interpretation developed by Canadian courts as a way of interpreting laws which are written in two parallel texts in English and French. The constitution of Canada requires that both versions of each Canadian law be treated as equally authoritative, which can result in problems when the English and French versions do not say exactly the same thing. The equal authenticity rule is derived from section 133 of the "Constitution Act, 1867", which