scholarly journals Strict Efficiency in Vector Optimization

2002 ◽  
Vol 265 (2) ◽  
pp. 264-284 ◽  
Author(s):  
Bienvenido Jiménez
2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Xiaohong Hu ◽  
Zhimiao Fang ◽  
Yunxuan Xiong

The concept of the well posedness for a special scalar problem is linked with strictly efficient solutions of vector optimization problem involving nearly convexlike set-valued maps. Two scalarization theorems and two Lagrange multiplier theorems for strict efficiency in vector optimization involving nearly convexlike set-valued maps are established. A dual is proposed and duality results are obtained in terms of strictly efficient solutions. A new type of saddle point, called strict saddle point, of an appropriate set-valued Lagrange map is introduced and is used to characterize strict efficiency.


2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Qinghai He ◽  
Weili Kong

In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra or the union of finitely many generalized polyhedra. Dropping the compactness assumption, we establish some results on structure of the weak Pareto solution set, Pareto solution set, weak Pareto optimal value set, and Pareto optimal value set of (SVOP) and on connectedness of Pareto solution set and Pareto optimal value set of (SVOP). In particular, we improved and generalize, Arrow, Barankin, and Blackwell’s classical results in Euclidean spaces and Zheng and Yang’s results in general Banach spaces.


Author(s):  
Surjeet Kaur Suneja ◽  
Bhawna Kohli

In this paper, K- quasiconvex, K- pseudoconvex and other related functions have been introduced in terms of their Clarke subdifferentials, where   is an arbitrary closed convex, pointed cone with nonempty interior. The (strict, weakly) -pseudomonotonicity, (strict) K- naturally quasimonotonicity and K- quasimonotonicity of Clarke subdifferential maps have also been defined. Further, we introduce Minty weak (MVVIP) and Stampacchia weak (SVVIP) vector variational inequalities over arbitrary cones. Under regularity assumption, we have proved that a weak minimum solution of vector optimization problem (VOP) is a solution of (SVVIP) and under the condition of K- pseudoconvexity we have obtained the converse for MVVIP (SVVIP). In the end we study the interrelations between these with the help of strict K-naturally quasimonotonicity of Clarke subdifferential map.


2018 ◽  
Vol 68 (2) ◽  
pp. 421-430
Author(s):  
Karel Pastor

Abstract In our paper we will continue the comparison which was started by Vsevolod I. Ivanov [Nonlinear Analysis 125 (2015), 270–289], where he compared scalar optimality conditions stated in terms of Hadamard derivatives for arbitrary functions and those which was stated for ℓ-stable functions in terms of Dini derivatives. We will study the vector optimization problem and we show that also in this case the optimality condition stated in terms of Hadamard derivatives is more advantageous.


Sign in / Sign up

Export Citation Format

Share Document