.png){kind=icon}
.png){kind=icon}
Return
On Roughly Convex Multiobjective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10013-026-00812-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider a roughly convex multiobjective optimization problem and use the concept of the outer gamma -convexity (resp., the gamma -convexlikeness) of the objective mapping, where gamma > 0 is the roughness degree of the objective one, to show that every gamma -local weak efficient solution (resp., gamma -local efficient solution) of the considered problem is also a global weak efficient one (resp., global efficient one). Necessary and sufficient conditions for efficiency solutions are established by using gamma -subdifferentials. Examples are also given to illustrate the obtained results.
Keywords:
Multiobjective optimization
Efficiency solution
Optimality condition
Rough convexity
gamma-subdifferential
Journal
V
IF:
0.7
Papers:
45
Citations:
0