Classroom Note:An Elementary Proof of Farkas' Lemma

DOI10.1137/S0036144594295502MaRDI QIDQ4376470zbMATH OpenWikidataFDO

Authors Achiya Dax

Publication date 10 February 1998

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0036144594295502

zbMATH Keywords

active set methodalgorithmelementary proofFarkas' lemmaleast-squares problem

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Linear programming (90C05)

Recommendations

• New approach to Farkas' theorem of the alternative
• scientific article; zbMATH DE number 3842629
• Theorems of alternative and optimization
• A Short Algebraic Proof of the Farkas Lemma

Cited in

(27)

• Theorems of the alternative and duality
• The adventures of a simple algorithm
• A new proof of the Kuhn-Tucker and Farkas theorems
• New approach to Farkas' theorem of the alternative
• KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions
• Nearly positive matrices
• Theorems of alternative and optimization
• A Simple Proof of Farkas' Lemma
• scientific article; zbMATH DE number 3842629 (Why is no real title available?)
• Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
• scientific article; zbMATH DE number 5168296 (Why is no real title available?)
• A simple algebraic proof of Farkas's lemma and related theorems
• scientific article; zbMATH DE number 54591 (Why is no real title available?)
• Solving Inequalities and Proving Farkas's Lemma Made Easy
• A proof of the Farkas-Minkowski theorem by a tandem method
• scientific article; zbMATH DE number 1870576 (Why is no real title available?)
• A discrete variant of Farkas' lemma and related results
• On semidefinite least squares and minimal unsatisfiability
• A note on the short algebraic proof of Farkas' Lemma
• Robust Farkas' lemma for uncertain linear systems with applications
• scientific article; zbMATH DE number 4184289 (Why is no real title available?)
• A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma
• A characterization of positive spanning sets with ties to strongly edge-connected digraphs
• Modal logic with ``Most
• Farkas' lemma for separable sublinear inequalities without qualifications
• An elementary proof of Freiling's symmetric covering theorem
• Necessary and sufficient conditions for solving infinite-dimensional linear inequalities

This page was built for publication: Classroom Note:An Elementary Proof of Farkas' Lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376470)