 Bland's rule prevents cycling and thus guarantees that the simplex algorithm always terminates.Another pivoting algorithm, the criss-cross algorithm never cycles on linear programs.History-based pivot rules such as Zadeh's rule and Cunningham's rule also try to circumvent the issue of stalling and cycling by keeping track how often particular variables are being used, and then favor such variables that have been used least often.