The Farkas Lemma revisited

DOI10.1007/s11202-010-0010-yzbMath1225.15020OpenAlexW2056649346WikidataQ30040162 ScholiaQ30040162MaRDI QIDQ605998

Semen S. Kutateladze

Publication date: 15 November 2010

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11202-010-0010-y

zbMATH Keywords

linear programmingalternative theoremlinear inequalitiesDedekind complete vector latticeBoolean valued modelFarkas Lemmainterval equationssublinear polyhedral inequalities

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Lattices (06B99)

Related Items (8)

Math-Selfie ⋮ Unnamed Item ⋮ Hahn-Banach-type theorems and applications to optimization for partially ordered vector space-valued invariant operators ⋮ Envelopes and inequalities in vector lattices ⋮ The polyhedral Lagrange principle ⋮ Boolean trends in linear inequalities ⋮ Leibnizian, Robinsonian, and Boolean valued monads ⋮ Hahn-Banach-type theorems and subdifferentials for invariant and equivariant order continuous vector lattice-valued operators with applications to optimization

Cites Work

• Farkas' lemma for separable sublinear inequalities without qualifications
• Farkas' lemma and multilinear forms
• Set containment characterization
• Different motivations and goals in the historical development of the theory of systems of linear inequalities
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Encyclopedia of Optimization
• A Short Algebraic Proof of the Farkas Lemma
• Linear Optimization Problems with Inexact Data
• Zero sets and linear dependence of multilinear forms
• Unnamed Item
• Unnamed Item

This page was built for publication: The Farkas Lemma revisited