Duality for vector optimization problems via a general scalarization

اسناد مشابه

• A unified vector optimization problem: complete scalarizations and applications

  مقاله‌ی دسترسی آزاد۲۰۱۱OptimizationFabiánFlores-Bazán, ElviraHernández

• Sufficiency and duality for a nonsmooth vector optimization problem with generalized $\alpha$-$d_{I}$-type-I univexity over cones

  مقاله۲۰۱۶Bulletin of the Iranian Mathematical SocietyH. Jiao

  In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient opt

• sufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{i}$-type-i univexity over cones‎

  مقالهbulletin of the iranian mathematical societyh. jiao, school of mathematics and statistics, yangtze normal university, chongqing 408100‎, p. r. ‎china.

  in this paper, using clarke’s generalized directional derivative and di-invexity we introduce new concepts of nonsmooth k-α-di-invex and generalized type i univex functions over cones for a nonsmooth vector optimization problem with cone constraints. we obtain some sufficient opt

• Strong and Converse Fenchel Duality for Vector Optimization Problems in Locally Convex Spaces

  سند علمی۲۰۰۹ANCA GRAD

  In relation to the vector optimization problem v-minx∈X(f + g ◦ A)(x), with f, g proper and cone-convex functions and A : X → Y a linear continuous operator between separated locally convex spaces, we define a general vector Fenchel-type dual problem. For the primal-dual pair we

• Vector duality for convex vector optimization problems with respect to quasi-minimality

  سند علمی۲۰۱۲Sorin-Mihai Grad

  We define the quasi-minimal elements of a set with respect to a convex cone and characterize them via linear scalarization. Then we attach to a general vector optimization problem a dual vector optimization problem with respect to quasi-efficient solutions and establish new duali

• Mixed E-duality for E-differentiable Vector Optimization Problems Under (Generalized) V-E-invexity

  مقاله‌ی دسترسی آزاد۲۰۲۱Operations Research Forum['Najeeb Abdulaleem', '']

  Abstract In this paper, a class of E -differentiable vector optimization problems with both inequality and equality constraints is considered. The so-called mixed -dual problem defined for the considered constraints. Then, several -duality theorems are established under (generali