.png){kind=icon}
.png){kind=icon}
Return
Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators
.png){kind=icon}
OA
AI
DOI：10.3390/fractalfract6010003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we establish Fritz John stationary conditions for nonsmooth, nonlinear, semidefinite, multiobjective programs with vanishing constraints in terms of convexificator and introduce generalized Cottle type and generalized Guignard type constraints qualification to achieve strong S-stationary conditions from Fritz John stationary conditions. Further, we establish strong S-stationary necessary and sufficient conditions, independently from Fritz John conditions. The optimality results for multiobjective semidefinite optimization problem in this paper is related to two recent articles by Treanta in 2021. Treanta in 2021 discussed duality theorems for special class of quasiinvex multiobjective optimization problems for interval-valued components. The study in our article can also be seen and extended for the interval-valued optimization motivated by Treanta (2021). Some examples are provided to validate our established results.
Keywords:
multiobjective programs with vanishing constraints
semidefinite programming
convexificators
nonsmooth analysis
constraint qualifications
Journal
IF:
3.3
Papers:
4.2K
Citations:
7.6K