An interior proximal method in vector optimization

2011 ◽  
Vol 214 (3) ◽  
pp. 485-492 ◽  
Author(s):  
Kely D.V. Villacorta ◽  
P. Roberto Oliveira
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.


Sign in / Sign up

Export Citation Format

Share Document