A finite crisscross method for oriented matroids

DOI10.1016/0095-8956(87)90049-9zbMath0588.05010WikidataQ60306608 ScholiaQ60306608MaRDI QIDQ1073036

Tamás Terlaky

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90049-9

zbMATH Keywords

base; oriented matroids; pivoting; finite criss-cross method; pivot rule; anty cycling rule; dual feasible cocircuit; general duality theorem; optimal oriented circuits; primal feasible circuit

Mathematics Subject Classification ID

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

Some generalizations of the criss-cross method for quadratic programming, Variants of the Hungarian method for solving linear programming problems, On circuit valuation of matroids, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, 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 pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, The linear complementarity problem, sufficient matrices, and the criss- cross method, Pivot rules for linear programming: A survey on recent theoretical developments, Criss-cross methods: A fresh view on pivot algorithms, New variants of finite criss-cross pivot algorithms for linear programming, The finite criss-cross method for hyperbolic programming, The role of pivoting in proving some fundamental theorems of linear algebra, The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP

Cites Work

• Unnamed Item
• Oriented matroids
• Orientability of matroids
• A combinatorial abstraction of linear programming
• The Criss-Cross Method for Solving Linear Programming Problems
• Complementarity in Oriented Matroids
• A convergent criss-cross method
• New Finite Pivoting Rules for the Simplex Method
• Lectures on matroids
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Some Empirical Tests of the Criss-Cross Method