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

Similar items

• Nonsmooth Vector Optimization Problem Involving Second-Order Semipseudo, Semiquasi Cone-Convex Functions

  Open-access article2020Statistics, Optimization & Information ComputingSunilaSharma, PriyankaYadav

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

  Article2016Bulletin 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

• Higher Order Duality for Vector Optimization Problem over Cones Involving Support Functions

  Scholarly record2015S. K. Suneja, Sunila Sharma, Priyanka Yadav

  In this paper, we consider a vector optimization problem over cones involving support functions in objective as well as constraints and associate a unified higher order dual to it. Duality result have been established under the conditions of higher order cone convex and related f

• On a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity

  Scholarly record2014Hehua Jiao, Sanyang Liu, Ferenc Hartung

  and Applied Analysis 3 Definition 2.2 see 16 . Let ψ : R → R be a locally Lipschitz function, then ψ◦ u;v denotes Clarke’s generalized directional derivative of ψ at u ∈ R in the direction v and is defined as ψ◦ u;v lim sup y→u t→ 0 ψ ( y tv ) − ψ(y) t . 2.4 Clarke’s generalized

• Duality for vector optimization problems with cone constraints involving support functions

  Scholarly record2014Priyanka Yadav

  In this work, first and higher order duality is discussed for vector optimization problems with cone constraint where every component of the objective function contains a term involving the support function of a compact convex set. It is an attempt to remove certain omissions and

• Duality for vector optimization problems via a general scalarization

  Scholarly record2010Radu Ioan Boţ, Sorin-Mihai Grad

  Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the pertu