Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative

DOI10.1016/j.laa.2011.12.009zbMath1242.90097OpenAlexW2054150164MaRDI QIDQ417521

David Bartl

Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.12.009

zbMATH Keywords

Gordan's theoremMotzkin's theoremresidual theorem for linear equationsStiemke's theoremTucker's theorem

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Range sets for weak efficiency in multiobjective linear programming and a parametric polytopes intersection problem ⋮ Parameter spaces of separating hyperplanes

Cites Work

• A residual existence theorem for linear equations
• Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
• A Short Algebraic Proof of the Farkas Lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item