scholarly journals Optimality conditions and duality results for a new class of nonconvex nonsmooth vector optimization problems

2021 ◽  
Vol 22 (1) ◽  
pp. 49
Author(s):  
Tadeusz Antczak ◽  
Ram Verma
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.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Tadeusz Antczak ◽  
Najeeb Abdulaleem

Abstract A new class of (not necessarily differentiable) multiobjective fractional programming problems with E-differentiable functions is considered. The so-called parametric E-Karush–Kuhn–Tucker necessary optimality conditions and, under E-convexity hypotheses, sufficient E-optimality conditions are established for such nonsmooth vector optimization problems. Further, various duality models are formulated for the considered E-differentiable multiobjective fractional programming problems and several E-duality results are derived also under appropriate E-convexity hypotheses.


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