On Approximate Solutions for Nonsmooth Interval-Valued Multiobjective Optimization Problems with Vanishing Constraints

Akriti Dwivedi, Vivek Laha, Miruna-Mihaela Beldiman and Andrei-Dan Halanay ()
Additional contact information
Akriti Dwivedi: Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi 221005, India
Vivek Laha: Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi 221005, India
Miruna-Mihaela Beldiman: Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 13 September Street No. 13, 050711 Bucharest, Romania
Andrei-Dan Halanay: Department of Mathematics, Bucharest University, 14 Academiei Street, 010014 Bucharest, Romania

Mathematics, 2025, vol. 13, issue 22, 1-27

Abstract: 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 (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/22/3699/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/22/3699/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:22:p:3699-:d:1797345

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().