Solving Inequalities and Proving Farkas's Lemma Made Easy

DOI10.2307/4145216MaRDI QIDQ4469100zbMATH OpenOpenAlexWikidataFDO

Authors David Avis, Bohdan Kaluzny

Publication date 14 June 2004

Published in The American Mathematical Monthly (Search for Journal in Brave)

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

zbMATH Keywords

Bland's pivot ruleFarkas's lemmalinear inequalitiessimplex method

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 3912670
• scientific article; zbMATH DE number 1507712
• A Simple Proof of Farkas' Lemma
• A simple algebraic proof of Farkas's lemma and related theorems
• Classroom Note:An Elementary Proof of Farkas' Lemma
• A simple proof and extensions of an inequality
• An inequality and a lemma revisited
• scientific article; zbMATH DE number 5841262
• A simple proof on strengthening and extension of inequalities
• scientific article; zbMATH DE number 5139235

Cited in

(5)

• scientific article; zbMATH DE number 4151744 (Why is no real title available?)
• scientific article; zbMATH DE number 59349 (Why is no real title available?)
• Integer Farkas lemma
• A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma
• Constrained cubic grid rigidity decision with directed graph and applications

This page was built for publication: Solving Inequalities and Proving Farkas's Lemma Made Easy

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