Linear programming duality: an introduction to oriented matroids

zbMath0757.90050MaRDI QIDQ1189586

Walter Kern, Achim Bachem

Publication date: 18 September 1992

Published in: Universitext (Search for Journal in Brave)

zbMATH Keywords

polyhedradualitypartially ordered setsoriented matroidsFarkas lemma

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (16)

Facets of the cone of exact games ⋮ Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes ⋮ Orientations of chain groups ⋮ Universal Gröbner basis associated with the maximum flow problem ⋮ Sufficient Conditions for Linear Stability of Complex-Balanced Equilibria in Generalized Mass-Action Systems ⋮ Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets ⋮ Edges versus circuits: a hierarchy of diameters in polyhedra ⋮ Greedy oriented flows ⋮ A theorem on the average number of subfaces in arrangements and oriented matroids ⋮ The central curve in linear programming ⋮ Facets of the cone of totally balanced games ⋮ Redundancy and Helly ⋮ Nested cones and onion skins ⋮ On the Bijectivity of Families of Exponential/Generalized Polynomial Maps ⋮ Computing complex and real tropical curves using monodromy ⋮ Investigations on autark assignments

This page was built for publication: Linear programming duality: an introduction to oriented matroids