Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Renying Zeng

Abstract In this paper, we introduce some definitions of generalized affine set-valued maps: affinelike, preaffinelike, nearaffinelike, and prenearaffinelike maps. We present examples to explain that our definitions of generalized affine maps are different from each other. We derive a theorem of alternative of Farkas–Minkowski type, discuss Lagrangian multipliers for constrained set-valued optimization problems, and obtain some optimality conditions for weakly efficient solutions.

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Dejin Zhang ◽  
Shuwen Xiang ◽  
Yanlong Yang ◽  
Xicai Deng

In this paper, the generic uniqueness of Pareto weakly efficient solutions, especially Pareto-efficient solutions, of vector optimization problems is studied by using the nonlinear and linear scalarization methods, and some further results on the generic uniqueness are proved. These results present that, for most of the vector optimization problems in the sense of the Baire category, the Pareto weakly efficient solution, especially the Pareto-efficient solution, is unique. Furthermore, based on these results, the generic Tykhonov well-posedness of vector optimization problems is given.


2017 ◽  
Vol 9 (4) ◽  
pp. 168
Author(s):  
Giorgio Giorgi

We take into condideration necessary optimality conditions of minimum principle-type, that is for optimization problems having, besides the usual inequality and/or equality constraints, a set constraint. The first part pf the paper is concerned with scalar optimization problems; the second part of the paper deals with vector optimization problems.


Sign in / Sign up

Export Citation Format

Share Document