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