A finite conformal-elimination free algorithm over oriented matroid programming

zbMath0627.90066MaRDI QIDQ1092810

Zhemin Wang

Publication date: 1987

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

zbMATH Keywords

conformal eliminationfinite pivoting methodminimum ratio testoriented matroid programming

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Exact methods for large-scale multi-period financial planning problems, Combinatorial redundancy detection, Finiteness of Criss-Cross Method in Complementarity Problem, 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, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, Pivot rules for linear programming: A survey on recent theoretical developments, New variants of finite criss-cross pivot algorithms for linear programming