Zadeh's rule

In every iteration, the algorithm then selects an improving variable that is minimal with respect to the retained occurrence record.

[3][4] Running the simplex algorithm with Zadeh's rule on the induced linear program then yields a super-polynomial lower bound.

The result was presented at the "Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?"

[5] Zadeh, although not working in academia anymore at that time, attended the Workshop and honored his original proposal.

[6] Friedmann's original result has since been strengthened by the construction of an exponential instance for Zadeh's rule.