A discrete variant of Farkas' lemma
From MaRDI portal
Publication:1728176
DOI10.1016/j.orl.2017.01.013zbMath1409.90105OpenAlexW2587436075WikidataQ124795716 ScholiaQ124795716MaRDI QIDQ1728176
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2017.01.013
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- The integer hull of a convex rational polytope
- A very short algebraic proof of the Farkas lemma
- A discrete Farkas lemma
- 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
- A simple algebraic proof of Farkas's lemma and related theorems
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- A note on the short algebraic proof of Farkas' Lemma
- Integer Farkas Lemma
- Nonnegative solvability of linear equations in certain ordered rings
- Systems of Linear Relations
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization