Invex Functions and Generalized Convexity in Multiobjective Programming

1998 ◽  
Vol 98 (3) ◽  
pp. 651-661 ◽  
Author(s):  
R. Osuna-Gómez ◽  
A. Rufián-Lizana ◽  
P. Ruíz-Canales
Keyword(s):  
Generalized Convexity ◽  
Multiobjective Programming ◽  
Invex Functions

scholarly journals E-invexity and generalized E-invexity in E-differentiable multiobjective programming

2019 ◽  
Vol 24 ◽  
pp. 01002 ◽  
Author(s):  
Najeeb Abdulaleem
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Differentiable Function ◽  
Generalized Convexity ◽  
Multiobjective Programming ◽  
Optimization Problems ◽  
Necessary Optimality Conditions ◽  
Vector Optimization Problems ◽  
Invex Functions ◽  
Differentiable Vector

In this paper, a new concept of generalized convexity is introduced for not necessarily differentiable vector optimization problems. For an E-differentiable function, the concept of E-invexity is introduced as a generalization of the E-differentiable E-convexity notion. In addition, some properties of E-differentiable E-invex functions are investigated. Furthermore, the so-called E-Karush-Kuhn-Tucker necessary optimality conditions are established for the considered E-differentiable vector optimization problems with both inequality and equality constraints. Also, the sufficiency of the E-Karush-Kuhn-Tucker necessary optimality conditions are proved for such E-differentiable vector optimization problems in which the involved functions are E-invex and/or generalized E-invex.

scholarly journals Generalized Convexity in Multiobjective Programming

1999 ◽  
Vol 233 (1) ◽  
pp. 205-220 ◽  
Author(s):  
R. Osuna-Gómez ◽  
A. Beato-Moreno ◽  
A. Rufian-Lizana
Keyword(s):  
Generalized Convexity ◽  
Multiobjective Programming

scholarly journals Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Wenyan Han ◽  
Guolin Yu ◽  
Tiantian Gong
Keyword(s):  
Optimality Conditions ◽  
Generalized Convexity ◽  
Multiobjective Programming ◽  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Efficient Solutions ◽  
Type I ◽  
Generalized Convex Functions ◽  
Alternative Theorem ◽  
Multiobjective Programming Problem

This note is devoted to the investigation of optimality conditions for robust approximate quasi weak efficient solutions to a nonsmooth uncertain multiobjective programming problem (NUMP). Firstly, under the extended nonsmooth Mangasarian–Fromovitz constrained qualification assumption, the optimality necessary conditions of robust approximate quasi weak efficient solutions are given by using an alternative theorem. Secondly, a class of generalized convex functions is introduced to the problem (NUMP), which is called the pseudoquasi-type-I function, and its existence is illustrated by a concrete example. Finally, under the pseudopseudo-type-I generalized convexity hypothesis, the optimality sufficient conditions for robust approximate quasi weak efficient solutions to the problem (NUMP) are established.

Sign in / Sign up

Export Citation Format

Share Document