Computing and proving with pivots

DOI10.1051/RO/2013042MaRDI QIDQ5397705zbMATH OpenOpenAlexFDO

Authors Frédéric Meunier

Publication date 24 February 2014

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2013042

zbMATH Keywords

combinatorial topologycomplementarity problemsconstructive proofspivoting algorithms

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Extreme-point and pivoting methods (90C49)

Recommendations

• The role of the pivot technique in the proof of some fundamental theorems of linear algebra.
• Practical finite pivoting rules for the simplex method
• Pivot vector method and its applications
• Pivot rules for linear programming: A survey on recent theoretical developments
• A general deterministic pivot method for oriented matroid programming

Cited in

(5)

• Which pivot to solve linear systems?
• Simplex pivots on the set packing polytope
• The role of the pivot technique in the proof of some fundamental theorems of linear algebra.
• Colorful linear programming, Nash equilibrium, and pivots
• scientific article; zbMATH DE number 4189471 (Why is no real title available?)

This page was built for publication: Computing and proving with pivots

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