On the finiteness of the criss-cross method

DOI10.1016/0377-2217(91)90343-TzbMath0747.90062MaRDI QIDQ1176822

Komei Fukuda, Tomomi Matsui

Publication date: 25 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

finitenesssimplex methodcriss-cross method

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

New variants of the criss-cross method for linearly constrained convex quadratic programming, Performance evaluation of a family of criss-cross algorithms for linear programming, Criss-cross methods: A fresh view on pivot algorithms, A new proof for the criss-cross method for quadratic programming, A basis enumeration algorithm for linear systems with geometric applications, Exterior point simplex-type algorithms for linear and network optimization problems, Fast enumeration algorithms for non-crossing geometric graphs, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING, Pivot versus interior point methods: Pros and cons, Pivot rules for linear programming: A survey on recent theoretical developments, New variants of finite criss-cross pivot algorithms for linear programming

Cites Work

• A finite crisscross method for oriented matroids
• A finite conformal-elimination free algorithm over oriented matroid programming
• A combinatorial abstraction of linear programming
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method