A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

A generalization of the Farka lemma is presented for nonlinear mappings which involve a convex process and a generalized convex function. Using this result, a complete characterization of optimality is obtained for the following nonsmooth programming problem: minimize f(x), subject to -b member of H...

Full description

Saved in:
Bibliographic Details
Published inJournal of optimization theory and applications Vol. 55; no. 3; pp. 449 - 461
Main Author Jeyakumar, V.
Format Journal Article
LanguageEnglish
Published New York, NY Springer 01.12.1987
Subjects
Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Non differential programming
Mathematical programming
Online AccessGet full text
ISSN0022-3239
1573-2878
DOI10.1007/BF00941180

Cover

More Information
Summary:A generalization of the Farka lemma is presented for nonlinear mappings which involve a convex process and a generalized convex function. Using this result, a complete characterization of optimality is obtained for the following nonsmooth programming problem: minimize f(x), subject to -b member of H(x), where f is a locally Lipschitz function satisfying a generalized convexity hypothesis and H is a closed convex process.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0022-3239
1573-2878
DOI:10.1007/BF00941180