The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP

DOI10.1111/j.1475-3995.1997.tb00083.xzbMath0907.90206OpenAlexW2069062174MaRDI QIDQ3842984

Hans-Jakob Lüthi, Makoto Namiki, Komei Fukuda

Publication date: 20 August 1998

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00083.x

zbMATH Keywords

simplex methodsadmissible pivotexistence of a short sequence

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (10)

Criss-cross methods: A fresh view on pivot algorithms ⋮ On the existence of a short pivoting sequence for a linear program ⋮ An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ EP theorems and linear complementarity problems ⋮ A distributed simplex algorithm for degenerate linear programs and multi-agent assignments ⋮ Finiteness of Criss-Cross Method in Complementarity Problem ⋮ Lexicographic perturbation for multiparametric linear programming with applications to control ⋮ Multiparametric linear programming with applications to control ⋮ Pivot versus interior point methods: Pros and cons

Cites Work

• Unnamed Item
• A finite crisscross method for oriented matroids
• Sufficient matrices and the linear complementarity problem
• A combinatorial abstraction of linear programming

This page was built for publication: The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP