A Simple Proof of Farkas' Lemma

DOI10.2307/2589288zbMath0987.90056OpenAlexW4251507673WikidataQ124876964 ScholiaQ124876964MaRDI QIDQ2757327

Vilmos Komornik

Publication date: 26 November 2001

Full work available at URL: https://doi.org/10.2307/2589288

zbMATH Keywords

linear programmingduality

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)

Related Items (4)

Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma ⋮ On the class of matrices with rows that weakly decrease cyclicly from the diagonal ⋮ A discrete variant of Farkas' lemma and related results

This page was built for publication: A Simple Proof of Farkas' Lemma