.png){kind=icon}
.png){kind=icon}
Return
On Approximate Solutions for Nonsmooth Interval-Valued Multiobjective Optimization Problems with Vanishing Constraints
.png){kind=icon}
PRE
AI
DOI：10.3390/math13223699.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose of this research is to develop approximate weak and strong stationary conditions for interval-valued multiobjective optimization problems with vanishing constraints (IVMOPVC) involving nonsmooth functions. In many real-world situations, the exact values of objectives are uncertain or imprecise; hence, interval-valued formulations are used to model such uncertainty more effectively. The proposed approximate weak and strong stationarity conditions provide a robust framework for deriving meaningful optimality results even when the usual constraint and data qualifications fail. We first introduce approximate variants of these qualifications and establish their relationships. Secondly, we establish some approximate KKT type necessary optimality conditions in terms of approximate weak strongly stationary points and approximate strong strongly stationary points to identify type-2 E-quasi weakly Pareto and type-1 E-quasi Pareto solutions of the IVMOPVC. Lastly, we show that the approximate weak and strong strongly stationary conditions are sufficient for optimality under some approximate convexity assumptions. All the outcomes are well illustrated by examples.
Keywords:
interval-valued multiobjective optimization
vanishing constraints
approximate constraint qualifications
approximate stationary conditions
approximate efficient solutions
Journal
IF:
2.2
Papers:
2.9K
Citations:
3.6W
View more organizations