| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 469943 | Computers & Mathematics with Applications | 2008 | 8 Pages |
Abstract
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 KK-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 KK-convexlike multifunctions using the Lagrange multiplier rule.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
María Alonso, Luis Rodríguez-Marín,