A note on second-order Karush–Kuhn–Tucker necessary optimality conditions for smooth vector optimization problems

2018 ◽  
Vol 52 (2) ◽  
pp. 567-575 ◽  
Author(s):  
Do Sang Kim ◽  
Nguyen Van Tuyen

The aim of this note is to present some second-order Karush–Kuhn–Tucker necessary optimality conditions for vector optimization problems, which modify the incorrect result in ((10), Thm. 3.2).

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.


2003 ◽  
Vol 2003 (7) ◽  
pp. 365-376 ◽  
Author(s):  
Davide La Torre

We introduce generalized definitions of Peano and Riemann directional derivatives in order to obtain second-order optimality conditions for vector optimization problems involvingC1,1data. We show that these conditions are stronger than those in literature obtained by means of second-order Clarke subdifferential.


2003 ◽  
Vol 8 (2) ◽  
pp. 165-174 ◽  
Author(s):  
Davide La Torre

In this paper we introduce a notion of generalized derivative for nonsmooth vector functions in order to obtain necessary optimality conditions for vector optimization problems. This definition generalizes to the vector case the notion introduced by Michel and Penot and extended by Yang and Jeyakumar. This generalized derivative is contained in the Clarke subdifferential and then the corresponding optimality conditions are sharper than the Clarke's ones.


4OR ◽  
2021 ◽  
Author(s):  
Tadeusz Antczak

AbstractIn this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality conditions and, under appropriate invexity hypotheses, sufficient optimality conditions are proved for such nonconvex smooth vector optimization problems. Further, vector duals in the sense of Mond–Weir are defined for the considered differentiable semi-infinite multiobjective programming problems with vanishing constraints and several duality results are established also under invexity hypotheses.


Sign in / Sign up

Export Citation Format

Share Document