Farkas' lemma for separable sublinear inequalities without qualifications
From MaRDI portal
Publication:732779
DOI10.1007/s11590-009-0133-xzbMath1206.90082OpenAlexW2033930023WikidataQ59241573 ScholiaQ59241573MaRDI QIDQ732779
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 15 October 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0133-x
optimality conditionsdualityrobust linear programminggeneralized Farkas lemmaseparable sublinear inequality
Related Items
Duality theorems for separable convex programming without qualifications ⋮ Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications ⋮ The Farkas Lemma revisited ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ Characterizing robust set containments and solutions of uncertain linear programs without qualifications ⋮ A new approach to strong duality for composite vector optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some convex programs without a duality gap
- A generalization of the Farkas lemma and applications to convex programming
- Robust optimization-methodology and applications
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
- Nonlinear alternative theorems and nondifferentiable programming
- A simple algebraic proof of Farkas's lemma and related theorems
- A generalized Farkas lemma with applications to quasidifferentiable programming
- Classroom Note:An Elementary Proof of Farkas' Lemma
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- Farkas-type theorems for positively homogeneous semi-infinite systems
- Convex Analysis
- Separable programming. Theory and methods
This page was built for publication: Farkas' lemma for separable sublinear inequalities without qualifications
