The Farkas Lemma revisited
From MaRDI portal
Publication:605998
DOI10.1007/s11202-010-0010-yzbMath1225.15020WikidataQ30040162 ScholiaQ30040162MaRDI QIDQ605998
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
linear programming; alternative theorem; linear inequalities; Dedekind complete vector lattice; Boolean valued model; Farkas Lemma; interval equations; sublinear polyhedral inequalities
Related Items
Unnamed Item, Math-Selfie, Envelopes and inequalities in vector lattices, Boolean trends in linear inequalities, The polyhedral Lagrange principle, 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, Hahn-Banach-type theorems and applications to optimization for partially ordered vector space-valued invariant operators
Cites Work
- Unnamed Item
- Unnamed Item
- 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