The simplex algorithm with a new primal and dual pivot rule

We present a simplex-type algorithm for linear programming that works with primal-feasible and dual-feasible points associated with bases that differ by only one column. The algorithm is almost unaffected by degeneracy, and a preliminary implementation compares favorably with the primal simplex method.