A finite conformal-elimination free algorithm over oriented matroid programming (Q1092810)

This paper presents a new finite pivoting method for oriented matroid programming which works principally on the smallest subscript rule appealing to no process of conformal elimination. In particular, when the oriented matroid programming under consideration is a linear program, the process of conformal elimination is just the process of minimum ratio test.