A new version of Farkas' lemma and global convex maximization
type: Item
instance of: scholarly article
title: A new version of Farkas' lemma and global convex maximization
zbMATH Open document ID: 0818.90088
DOI: 10.1016/0893-9659(93)90097-7
author: V. Pereyra
published in: Applied Mathematics Letters
publication date: 1994-01-19T00:00:00Z
review text: The authors give a nonlinear extension of Farkas' Lemma with a reverse convex inequality and apply the results in order to characterize optimality for the following constrained convex maximization problem without regularity condition: maximize \(f(x)\) subject to \(-g(x)- b\in S\), where \(f\) is continuous and convex and \(\lambda g\) is difference sublinear for each \(\lambda\in S^*\).
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 488015
zbMATH Keywords: nonlinear extension of Farkas' Lemma
zbMATH Keywords: reverse convex inequality
zbMATH Keywords: constrained convex maximization
reviewed by: Hans Benker
MaRDI profile type: Publication
Wikidata QID: Q124900500
full work available at URL: 0893-9659(93)90097-7
OpenAlex ID: W1974461145
cites work: Q3972966
cites work: Q3997222
cites work: A Farkas lemma for difference sublinear systems and quasidifferentiable programming
cites work: A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
cites work: Q5613420
cites work: Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
description: scientific article; zbMATH DE number 488015