Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps.
Xu, Y.D., Li, S.J. (2011)
Journal of Inequalities and Applications [electronic only]
Similarity:
Displaying similar documents to “Unified duality for vector optimization problem over cones involving support functions”
Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps.
Optimality conditions of vector set-valued optimization problem involving relative interior.
Zhou, Zhiang (2011)
Journal of Inequalities and Applications [electronic only]
Similarity:
Second-order optimality conditions for nondominated solutions of multiobjective programming with data
Liping Liu, Pekka Neittaanmäki, Michal Křížek (2000)
Applications of Mathematics
Similarity:
We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class . Second-order optimality conditions for local Pareto solutions are derived as a special case.
Duality in vector optimization. I. Abstract duality scheme
Tran Quoc Chien (1984)
Kybernetika
Similarity:
Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity.
Qiu, Qiusheng (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
Sufficient Second Order Optimality Conditions for C^1 Multiobjective Optimization Problems
Gadhi, N. (2003)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: Primary 90C29; Secondary 90C30. In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C^1, but not necessarily of class C^(1.1).