A finite conformal-elimination free algorithm over oriented matroid programming
From MaRDI portal
Publication:1092810
zbMath0627.90066MaRDI QIDQ1092810
Publication date: 1987
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
90C05: Linear programming
90C27: Combinatorial optimization
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
On the finiteness of the criss-cross method, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, A basis enumeration algorithm for linear systems with geometric applications, Pivot rules for linear programming: A survey on recent theoretical developments, New variants of finite criss-cross pivot algorithms for linear programming