Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 49, Issue 2, Pages 265-280Publisher
SPRINGER
DOI: 10.1007/s10898-010-9543-7
Keywords
Multiobjective programming problem; Strict local efficientsolution; D. C. optimization; Convex subdifferential; Saddle pointof higher order
Ask authors/readers for more resources
The article pertains to characterize strict local efficient solution (s.l.e.s.) of higher order for the multiobjective programming problem (MOP) with inequality constraints. To create the necessary framework, we partition the index set of objectives of MOP to give rise to subproblems. The s.l.e.s. of order m for MOP is related to the local efficient solution of a subproblem. This relationship inspires us to adopt the D.C. optimization approach, the convex subdifferential sum rule, and the notion of epsilon-subdifferential to derive the necessary and sufficient optimality conditions for s.l.e.s. of order m >= 1 for the convex MOP. Further, the saddle point criteria of higher order are also presented.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available