Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity

2008 ◽  
Vol 45 (2) ◽  
pp. 319-334 ◽  
Author(s):  
Tadeusz Antczak
Keyword(s):  
Multiobjective Programming ◽  
Nonsmooth Multiobjective Programming ◽  
Optimality And Duality ◽  
Multiobjective Programming Problems

scholarly journals Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems

Filomat ◽  
2019 ◽  
Vol 33 (6) ◽  
pp. 1619-1639
Author(s):  
Tadeusz Antczak ◽  
Hachem Slimani
Keyword(s):  
Multiobjective Programming ◽  
Vector Optimization Problem ◽  
Order Type ◽  
Higher Order ◽  
Type I ◽  
New Class ◽  
Duality Results ◽  
Nonsmooth Multiobjective Programming ◽  
Multiobjective Programming Problem ◽  
Multiobjective Programming Problems

In this paper, a nonconvex nonsmooth multiobjective programming problem is considered and two its higher-order duals are defined. Further, several duality results are established between the considered nonsmooth vector optimization problem and its dual models under assumptions that the involved functions are higher-order (??)-type I functions.

Sign in / Sign up

Export Citation Format

Share Document