A Finite Conformal-Elimination Free Algorithm over Oriented MatroidProgramming
Citation：
Wang Zhemin.A Finite Conformal-Elimination Free Algorithm over Oriented MatroidProgramming[J].Chinese Annals of Mathematics B,1987,8(1):120~126
Page view： 1091Net amount： 767
Authors：
Wang Zhemin;
Abstract：
This paper presents a new finite pivoting method for oriented 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 programming, the process of conformal elimination is just the process of minimum ratio test.
