A combinatorial abstraction of linear programming

DOI10.1016/0095-8956(77)90055-7zbMath0375.90046MaRDI QIDQ1245770

Robert G. Bland

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

Mathematics Subject Classification ID

90C05: Linear programming

Related Items

Some generalizations of the criss-cross method for quadratic programming, On circuit valuation of matroids, Characterizations of *-families, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, 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, Linear quadratic programming in oriented matroids, Recent trends in combinatorial optimization, Polarity and inner products in oriented matroids, Oriented matroids from smooth manifolds, A finite crisscross method for oriented matroids, Large convex sets in oriented matroids, Adjoints of oriented matroids, Completeness in oriented matroids, Symmetry and positive definiteness in oriented matroids, Directed submodularity, ditroids and directed submodular flows, 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, Euclideaness and final polynomials in oriented matroid theory, Pivot rules for linear programming: A survey on recent theoretical developments, Criss-cross methods: A fresh view on pivot algorithms, On \({\mathbb{K}}^{\Delta}\), Unimodular modules, Complementarity in Oriented Matroids, A simple algebraic proof of Farkas's lemma and related theorems, The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP

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