A simple algebraic proof of Farkas's lemma and related theorems

DOI10.1080/10556789808805676zbMath0907.90204OpenAlexW2016241052WikidataQ124879054 ScholiaQ124879054MaRDI QIDQ3839445

Charles Broyden

Publication date: 9 August 1998

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805676

zbMATH Keywords

dualityFarkas' lemmaorthogonal matricesCayley transforms

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (11)

Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ On Chubanov’s Method for Solving a Homogeneous Inequality System ⋮ A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma ⋮ Persistence and extinction in the anti-symmetric Lotka-Volterra systems ⋮ Note on a paper of Broyden ⋮ A discrete variant of Farkas' lemma ⋮ Tucker's theorem for almost skew-symmetric matrices and a proof of Farkas' lemma ⋮ A discrete variant of Farkas' lemma and related results ⋮ 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

Cites Work

• A combinatorial abstraction of linear programming
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
• Some \(LP\) algorithms using orthogonal matrices
• Theorems of the alternative and duality
• On the Development of Optimization Theory
• Lectures on Polytopes
• Classroom Note:An Elementary Proof of Farkas' Lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple algebraic proof of Farkas's lemma and related theorems