.png){kind=icon}
Return
OPTIMALITY AND STABILITY CONDITIONS FOR BENSON EFFICIENT SOLUTIONS IN VECTOR OPTIMIZATION PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.23952/jnva.9.2025.5.05.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we explore two fundamental properties of Benson efficient solutions for vector optimization problems with set-valued objective mappings based on the recession cone of a nonempty set. Specifically, we focus on the optimality conditions and stability properties of these solutions. First, we employ the scalarization method to establish sufficient and necessary optimality conditions for the unconstrained optimization problems. Then, by utilizing these techniques along with a generalized Slater constraint qualification, we obtain the corresponding results for reference problems with constraints. When the data of the considered problems is perturbed by parameters given in parameter spaces, we use scalar representations of the solutions in combination with generalized convexity concepts to study the stability of Benson efficient solution mappings in the sense of semicontinuity for these parametric optimization problems. Various examples are given to highlight the applications and distinctions of the results achieved in this study.
Keywords:
Benson efficient solution
Improvement set
Optimality condition
Vector optimization problem
Recession cone
Semicontinuity
Journal
IF:
1.9
Papers:
72
Citations:
356
Organization
Cited Papers
No cited papers available