New variants of finite criss-cross pivot algorithms for linear programming

In this paper we generalize the so-called first-in-last-out pivot rule and the most-often-selected-variable pivot rule for the simplex method, as proposed in S. Zhang to the criss-cross pivot setting where neither the primal nor the dual feasibility is preserved. The finiteness of the new criss-cross pivot variants is proven.