DMCA
DUALITY WITHOUT CONSTRAINT QUALIFICATION IN NONSMOOTH OPTIMIZATION (2006)
Cached
Download Links
BibTeX
@MISC{Nobakhtian06dualitywithout,
author = {S. Nobakhtian},
title = {DUALITY WITHOUT CONSTRAINT QUALIFICATION IN NONSMOOTH OPTIMIZATION},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We are concerned with a nonsmooth multiobjective optimization problem with inequal-ity constraints. In order to obtain our main results, we give the definitions of the gener-alized convex functions based on the generalized directional derivative. Under the above generalized convexity assumptions, sufficient and necessary conditions for optimality are given without the need of a constraint qualification. Then we formulate the dual problem corresponding to the primal problem, and some duality results are obtained without a constraint qualification. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1.
Keyphrases
constraint qualification nonsmooth multiobjective optimization problem generalized convexity assumption gener-alized convex function generalized directional derivative necessary condition dual problem inequal-ity constraint main result duality result primal problem hindawi publishing corporation
