In this paper we discuss the connections of four generalized constraint qualifications for set-valued vector optimization problems with constraints. Then some K-T type necessary and sufficient optimality conditions are derived, in terms of the contingent epiderivatives.
✦ LIBER ✦
Optimality conditions for a nonconvex set-valued optimization problem
✍ Scribed by María Alonso; Luis Rodríguez-Marín
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 253 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we study necessary and sufficient optimality conditions for a set-valued optimization problem. Convexity of the multifunction and the domain is not required. A definition of K -approximating multifunction is introduced. This multifunction is the differentiability notion applied to the problem. A characterization of weak minimizers is obtained for invex and generalized K -convexlike multifunctions using the Lagrange multiplier rule.
📜 SIMILAR VOLUMES
Generalized Constraint Qualifications an
Generalized Constraint Qualifications and Optimality Conditions for Set-Valued Optimization Problems
✍
Huang Yong-Wei
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 106 KB
The Optimality Conditions for Vector Opt
✍
Zemin Li
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 88 KB
Necessary optimality conditions for weak
✍
M. Durea; R. Strugariu
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 355 KB
A nonconvex, piecewise linear optimizati
✍
Bahia Benchekroun; James E. Falk
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 411 KB
Optimality conditions for a relaxed layo
✍
Eric Bonnetier; Carlos Conca
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 396 KB
Nondegenerate Necessary Conditions for N
✍
M.M.A Ferreira; F.A.C.C Fontes; R.B Vinter
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 106 KB