A finite conformal-elimination free algorithm over oriented matroid programming

MaRDI QIDQ1092810zbMATH OpenFDO

Authors 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

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

Recommendations

• A general deterministic pivot method for oriented matroid programming
• Euclideaness and final polynomials in oriented matroid theory
• scientific article; zbMATH DE number 4027490
• A finite crisscross method for oriented matroids
• scientific article; zbMATH DE number 4106867

Cited in

(13)

• 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
• A general deterministic pivot method for oriented matroid programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• New variants of finite criss-cross pivot algorithms for linear programming
• Combinatorial redundancy detection
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• scientific article; zbMATH DE number 4027490 (Why is no real title available?)
• scientific article; zbMATH DE number 4106867 (Why is no real title available?)
• Finiteness of Criss-Cross Method in Complementarity Problem
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
• Exact methods for large-scale multi-period financial planning problems

This page was built for publication: A finite conformal-elimination free algorithm over oriented matroid programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092810)