Scalarization in geometric and functional vector optimization revisited (Q2442706): Difference between revisions

This paper gives a survey about some recent results in the area of optimality conditions for vector optimization problems with geometric as well as inequality/equality constraints. Section 2 considers such problems with geometrical constraints and gives first a survey on recent developments (Section 2.1). Then in Section 2.2, the assumptions on both the ordering cone and the image space are weakened. Some new results are presented which aim to complete previous achievements by Durea and Dutta (2008) as well as Bao and Tammer (2012) [\textit{T. Q. Bao} and \textit{Chr. Tammer}, Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 75, No. 3, 1089--1103 (2012; Zbl 1261.90088)]. Section 3 deals with Pareto efficiency for problems with functional constraints. Here the major results are presented in Theorems 3.1 to 3.4. For simplicity of the presentation, the authors consider the smooth case and the classical constraint qualification conditions. First, the authors consider the weak efficiency case. Then for the genuine case, a new result on approximate efficiency (Theorem 3.3) is derived which was obtained by means of Michel-Penot subdifferential calculus and a different scalarization technique. The last necessary optimality condition for Pareto efficiency (Theorem 3.4) is obtained by using some alternative normal compactness conditions on the ordering cone and the image space. Finally, some possible extensions are briefly sketched.