Farkas' lemma for separable sublinear inequalities without qualifications
From MaRDI portal
Publication:732779
DOI10.1007/S11590-009-0133-XzbMATH Open1206.90082DBLPjournals/ol/JeyakumarL09OpenAlexW2033930023WikidataQ59241573 ScholiaQ59241573MaRDI QIDQ732779FDOQ732779
Authors: V. Jeyakumar, G. Li 
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
Recommendations
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- scientific article; zbMATH DE number 4003920
dualityoptimality conditionsrobust linear programminggeneralized Farkas lemmaseparable sublinear inequality
Cites Work
- Convex Analysis
- Robust optimization-methodology and applications
- Title not available (Why is that?)
- From linear to convex systems: consistency, Farkas' lemma and applications
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
- Some convex programs without a duality gap
- Farkas-type theorems for positively homogeneous semi-infinite systems
- A generalization of the Farkas lemma and applications to convex programming
- A generalized Farkas lemma with applications to quasidifferentiable programming
- A simple algebraic proof of Farkas's lemma and related theorems
- Classroom Note:An Elementary Proof of Farkas' Lemma
- Title not available (Why is that?)
- Nonlinear alternative theorems and nondifferentiable programming
- Separable programming. Theory and methods
Cited In (9)
- A new approach to strong duality for composite vector optimization problems
- The Farkas Lemma revisited
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Duality theorems for separable convex programming without qualifications
- Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
- Robust Farkas' lemma for uncertain linear systems with applications
- Solvability results for sublinear functions and operators
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
This page was built for publication: Farkas' lemma for separable sublinear inequalities without qualifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732779)
