A combinatorial abstraction of linear programming
From MaRDI portal
Publication:1245770
DOI10.1016/0095-8956(77)90055-7zbMath0375.90046OpenAlexW1988235646MaRDI QIDQ1245770
Publication date: 1977
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(77)90055-7
Related Items
Large convex sets in oriented matroids, Adjoints of oriented matroids, Completeness in oriented matroids, Symmetry and positive definiteness in oriented matroids, Criss-cross methods: A fresh view on pivot algorithms, Directed submodularity, ditroids and directed submodular flows, Complementarity in Oriented Matroids, Abstract tropical linear programming, Every non-Euclidean oriented matroid admits a biquadratic final polynomial, Some generalizations of the criss-cross method for quadratic programming, Ham-sandwich cuts for abstract order types, Unimodular modules, A proof of the strict monotone 5-step conjecture, On the finiteness of the criss-cross method, A basis enumeration algorithm for linear systems with geometric applications, Five variations on a theme by Gyula Farkas, Positively oriented matroids are realizable, Topological representation of dual pairs of oriented matroids, Oriented matroids with few mutations, Two constructions of oriented matroids with disconnected extension space, Combinatorial obstructions to the lifting of weaving diagrams, A simple algebraic proof of Farkas's lemma and related theorems, On circuit valuation of matroids, The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP, Characterizations of *-families, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Linear quadratic programming in oriented matroids, On the Holt-Klee property for oriented matroid programming, On \({\mathbb{K}}^{\Delta}\), Recent trends in combinatorial optimization, Euclideaness and final polynomials in oriented matroid theory, Polarity and inner products in oriented matroids, Pivot rules for linear programming: A survey on recent theoretical developments, Oriented matroids from smooth manifolds, A finite crisscross method for oriented matroids
Cites Work
- Oriented matroids
- Orientability of matroids
- New Finite Pivoting Rules for the Simplex Method
- The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems
- Lectures on matroids
- Modules unimodulaires
- Basis graphs of pregeometries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
