Next Article in Journal
On the Topological Classification of Four-Dimensional Steady Gradient Ricci Solitons with Nonnegative Sectional Curvature
Previous Article in Journal
Investigations on the Chaos in the Generalized Double Sine-Gordon Planar System: Melnikov’s Approach and Applications to Generating Antenna Factors
Previous Article in Special Issue
Optimal GQPC Codes over the Finite Field Fq
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

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

1
Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi 221005, India
2
Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 13 September Street No. 13, 050711 Bucharest, Romania
3
Department of Mathematics, Bucharest University, 14 Academiei Street, 010014 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(22), 3699; https://doi.org/10.3390/math13223699
Submission received: 8 October 2025 / Revised: 12 November 2025 / Accepted: 14 November 2025 / Published: 18 November 2025
(This article belongs to the Special Issue Recent Developments in Theoretical and Applied Mathematics)

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-1E-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 interval-valued multiobjective optimization; vanishing constraints; approximate constraint qualifications; approximate stationary conditions; approximate efficient solutions

Share and Cite

MDPI and ACS Style

Dwivedi, A.; Laha, V.; Beldiman, M.-M.; Halanay, A.-D. On Approximate Solutions for Nonsmooth Interval-Valued Multiobjective Optimization Problems with Vanishing Constraints. Mathematics 2025, 13, 3699. https://doi.org/10.3390/math13223699

AMA Style

Dwivedi A, Laha V, Beldiman M-M, Halanay A-D. On Approximate Solutions for Nonsmooth Interval-Valued Multiobjective Optimization Problems with Vanishing Constraints. Mathematics. 2025; 13(22):3699. https://doi.org/10.3390/math13223699

Chicago/Turabian Style

Dwivedi, Akriti, Vivek Laha, Miruna-Mihaela Beldiman, and Andrei-Dan Halanay. 2025. "On Approximate Solutions for Nonsmooth Interval-Valued Multiobjective Optimization Problems with Vanishing Constraints" Mathematics 13, no. 22: 3699. https://doi.org/10.3390/math13223699

APA Style

Dwivedi, A., Laha, V., Beldiman, M.-M., & Halanay, A.-D. (2025). On Approximate Solutions for Nonsmooth Interval-Valued Multiobjective Optimization Problems with Vanishing Constraints. Mathematics, 13(22), 3699. https://doi.org/10.3390/math13223699

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop