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
Zaitsev's rule the University of Kazan in 1873. Zaitsev had cited Popov's 1872 paper in previous work and worked at the University of Kazan, and was thus probably aware of Popov's proposed rule. In spite of this, Zaitsev's 1875 "Liebigs Annalen" paper makes no mention of Popov's work. Any discussion of Zaitsev's rule would be incomplete without mentioning Vladimir Vasilyevich Markovnikov. Zaitsev and Markovnikov both studied under Alexander Butlerov, taught at the University of Kazan during the same period, and were bitter rivals. Markovnikov, who published in 1870 what is now known as Markovnikov's rule, and Zaitsev held conflicting views regarding elimination