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
Littlewood's rule rejected. If a continuous distribution formula_14 is used to model the demand, then formula_15 can be calculated using what is called "Littlewood’s rule": This gives the optimal protection limit, in terms of the division of the marginal revenue of both classes. Alternatively bid prices can be calculated via Littlewood's model is limited to two classes. P. Belobaba developed a model based on this rule called Expected marginal seat revenue, abbreviated as EMSR, which is an formula_17-class model Littlewood's rule The earliest Revenue Management model is known as "Littlewood’s rule", developed by Ken Littlewood while working at British Overseas Airways Corporation.