Farkas' lemma for separable sublinear inequalities without qualifications
From MaRDI portal
(Redirected from Publication:732779)
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
Cites work
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- 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
- Convex Analysis
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
- Farkas-type theorems for positively homogeneous semi-infinite systems
- From linear to convex systems: consistency, Farkas' lemma and applications
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- Nonlinear alternative theorems and nondifferentiable programming
- Robust optimization-methodology and applications
- Separable programming. Theory and methods
- Some convex programs without a duality gap
Cited in
(9)- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Solvability results for sublinear functions and operators
- The Farkas Lemma revisited
- Duality theorems for separable convex programming without qualifications
- A new approach to strong duality for composite vector optimization problems
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Robust Farkas' lemma for uncertain linear systems with applications
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)
