Classroom Note:An Elementary Proof of Farkas' Lemma
From MaRDI portal
Publication:4376470
DOI10.1137/S0036144594295502zbMath0891.15011WikidataQ124856286 ScholiaQ124856286MaRDI QIDQ4376470
Publication date: 10 February 1998
Published in: SIAM Review (Search for Journal in Brave)
Related Items (14)
Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ Theorems of the alternative and duality ⋮ KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions ⋮ Nearly positive matrices ⋮ A new proof of the Kuhn-Tucker and Farkas theorems ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ A discrete variant of Farkas' lemma and related results ⋮ A simple algebraic proof of Farkas's lemma and related theorems ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ A note on the short algebraic proof of Farkas' Lemma ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ New approach to Farkas' theorem of the alternative ⋮ Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach ⋮ The adventures of a simple algorithm
This page was built for publication: Classroom Note:An Elementary Proof of Farkas' Lemma
