(P) Maximize f (x)=[f1 (x), f2 (x),..., fk (x)] subject to xeX={x: xeS, g (x) § 0, h (x)= 0}, where S is
a non-empty open convex subset of R" and f: S~+ R", g: S—> R'", and h: S—> R'are …

New classes of generalized (F, ρ)-convexity are introduced for vector-valued functions.
Examples are given to show their relations with (F, ρ)-pseudoconvex,(F, ρ)-quasiconvex …

In this paper, a pair of nondifferentiable multiobjective programming problems is first
formulated, where each of the objective functions contains a support function of a compact …

In this paper, a new concept of generalized convexity is introduced for not necessarily
differentiable vector optimization problems with E-differentiable functions. Namely, for an E …

In this paper new classes of functions, namelyd-type-I, d-quasitype-I, andd-pseudo type-I,
are defined for a multiobjective nondifferentiable programming problem. Kuhn–Tucker-type …

(VP) Minimize f (x), x E x where f: X-+ W'and X is an open subset of KY; and minimization
means obtaining efficient solutions in the following sense. A point XE X is an efficient …

On optimality and duality for multiobjective programming problems involving generalized d-type-I
and related n-set functions Page 1 J. Math. Anal. Appl. 283 (2003) 114–128 www.elsevier.com/locate/jmaa …

In this chapter, we present a unified formulation of generalized convex functions. Based on
these concepts, sufficient optimality conditions for a nondifferentiable multiobjective …

Necessary conditions for Pareto optimality in multiobjective programming with
subdifferentiable set functions are established in Theorem 12 of HC Lai and LJ Lin (J. Math …

Abstract Recently Hachimi and Aghezzaf introduced the notion of (F, α, ρ, d)-type I functions,
a new class of functions that unifies several concepts of generalized type I functions. Here …