Weak sharp minima in multiobjective optimization
Marcin Studniarski (2007)
Control and Cybernetics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Weak -sharp minima in vector optimization problems.”
Weak sharp minima in multiobjective optimization
On weak sharp minima in vector optimization with applications to parametric problems
Ewa Bednarczuk (2007)
Control and Cybernetics
Similarity:
Unified duality for vector optimization problem over cones involving support functions
Surjeet Kaur Suneja, Pooja Louhan (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we give necessary and sufficient optimality conditions for a vector optimization problem over cones involving support functions in objective as well as constraints, using cone-convex and other related functions. We also associate a unified dual to the primal problem and establish weak, strong and converse duality results. A number of previously studied problems appear as special cases.
Optimality conditions of vector set-valued optimization problem involving relative interior.
Zhou, Zhiang (2011)
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).
Local cone approximations in optimization
M. Castellani, M. Pappalardo (2007)
Control and Cybernetics
Similarity:
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:
Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints
Truong Q. Bao, Boris S. Mordukhovich (2007)
Applications of Mathematics
Similarity:
In this paper we study set-valued optimization problems with equilibrium constraints (SOPECs) described by parametric generalized equations in the form where both and are set-valued mappings between infinite-dimensional spaces. Such models particularly arise from certain optimization-related problems governed by set-valued variational inequalities and first-order optimality conditions in nondifferentiable programming. We establish general results on the existence of optimal solutions...
Strong-weak Stackelberg Problems in Finite Dimensional Spaces
Aboussoror, Abdelmalek, Loridan, Pierre (1995)
Serdica Mathematical Journal
Similarity:
We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present...