Next Article in Journal
On the Topological Classification of Four-Dimensional Steady Gradient Ricci Solitons with Nonnegative Sectional Curvature
Next Article in Special Issue
Optimal Consumption and Investment Problem with Consumption Ratcheting in Luxury Goods
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:
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-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.

1. Introduction

The idea of mathematical programs with vanishing constraints (MPVC), was first introduced by Achtziger and Kanzow [1], which is an extension of mathematical programming with equillibrium constraints (MPEC); see, e.g., [2,3,4,5]. However, under standard constraint qualifications, these models fall short of meeting optimality standards. Consequently, Achtziger and Kanzow [1] proposed a modified CQ and established related optimality results. Moreover, Hoheisel and Kanzow [6] investigated different CQs for a subset of MPVC. These types of problems constitute a novel class of optimization problems that have significant applications in the field of topology design for mechanical structures. Izmailov and Pogosyan [7] established standard optimality conditions for an optimization problem involving constraints that become negligible or vanish under certain conditions. Additionally, they proposed a solution method based on Newton’s approach for solving such optimization problems with vanishing constraints. Inspired by the work of Izmailov and Pogosyan [7], Dorsch et al. [8] formulated a critical point theory for mathematical models subject to vanishing constraints. Achtziger et al. [9] suggested a regularization method to solve smooth optimization problems involving vanishing constraints. Many researchers have subsequently investigated the dual models corresponding to MPVCs; for more detailed information on these works, see [10,11,12]. The mathematical concept of MPVC has become quite popular and attracted significant interest recently. Numerous authors have studied and worked on MPVC models. Initially, the functions involved in MPVC are considered to be continuously differentiable, see e.g., [1,6,12,13,14]. Recently, there is research focused on nonsmooth or non-differentiable cases of MPVC, which is covered in [15,16,17].
Interval-valued programming is a type of optimization problem where some or all of the parameters are intervals or ranges rather than precise values. In these problems, the goal is to find the optimal solution that satisfies the constraints and optimizes the objective function over the given intervals. Solving interval-valued programming problems typically involves techniques from interval analysis, which deals with the arithmetic operations and computations involving intervals. Different approaches have been developed, including: interval-valued linear programming, interval-valued non-linear programming. The main challenge in interval-valued programming lies in the presence of interval parameters, which can lead to an infinite number of possible scenarios within the feasible region. As a result, the solution methods aim to find solutions that are optimal or near optimal for all possible realizations of the intervals. Wu [18] developed two solution concepts by considering two partial orderings on the set of all closed intervals. The development of these solution concepts resulted in the establishment of the Karush-Kuhn-Tucker (KKT) conditions for a differentiable interval-valued scalar optimization problem. In order to establish duality results, Wu [19] formulated four different types of interval-valued optimization problems and derived the corresponding KKT optimality conditions for each type. Various researchers [20,21,22,23,24,25,26,27] contributed to developing formulations, deriving optimality conditions, and exploring interval-valued optimization problems, particularly related to Lagrangian duality, KKT conditions, and multiobjective optimization.
Rani et al. [28] derived optimality conditions and duality results for multiobjective interval-valued programming problems involving vanishing constraints. Yadav and Gupta [29] established the necessary and sufficient conditions, under certain assumptions of constraint qualifications and convexity, for solving a multiobjective interval-valued semi-infinite optimization problem with vanishing constraints. They also formulated Wolfe’s and Mond-Weir type dual models for such problems. Van Su and Hang [30] studied nonsmooth semi-infinite interval-valued multiobjective programming problems with vanishing constraints and derived Karush–Kuhn–Tucker (KKT) type necessary and sufficient optimality conditions and duality results based on Hadamard derivatives. Subsequently, Upadhyay et al. [31] developed a Newton-type algorithm for interval-valued multiobjective programming problems. Recent research efforts in the area of multiobjective mathematical programming problems involving interval-valued functions and vanishing constraint Ahmad et al. [32], Joshi et al. [33,34] have significantly broadened and advanced this field of study.
The natural intersection of these two areas interval-valued optimization and vanishing constraints has recently attracted attention. Despite this progress, one critical gap remains unaddressed: the role of approximation in deriving strongly stationary conditions for IVMOPVC. Existing studies largely focus on exact solutions, which, while mathematically rigorous, often fail to capture the approximate nature of real-world decision-making, where data uncertainty and computational limitations make exact solutions impractical. This paper aims to bridge that gap. Motivated by the aforementioned limitations, we study approximate strong stationarity conditions for (IVMOPVC) within the framework of the Clarke subdifferential. The key contributions of our work are as follows:
  • Approximate Strong Stationarity: We formulate necessary conditions that remain valid when the solution obtained is approximate rather than exact, thereby broadening the applicability of MPVC theory to more realistic settings.
  • New Constraint and Data Qualifications: We introduce several approximate constraint and data qualifications specifically designed for IVMOPVC and examine their interconnections.
  • Theoretical Advancement with Approximation: By embedding approximation into the stationarity framework, we ensure that the results are both mathematically rigorous and adaptable to uncertain optimization contexts.
  • Sufficient Conditions: In addition to necessity, we establish conditions under which approximate strong stationarity leads to approximate optimality, thereby strengthening the practical relevance of the framework.
In essence, our work takes IVMOPVC beyond exact mathematical theory and develops approximation-based results that are both rigorous and practical. This innovation opens new avenues for solving complex interval-valued multiobjective optimization problems with vanishing constraints, especially in applications where exact solutions are unattainable but high-quality approximations are essential.
This paper is organized as follows: in Section 2, the essential definitions and preliminary results are provided that will serve as the foundation for the studies and findings given in this paper. Section 3 presents the main results of this paper. It introduces several approximate constraint qualifications and data qualifications for the interval-valued multiobjective optimization problem with vanishing constraints (IVMOPVC) and explores the relationships among them. Utilizing these constraint qualifications, the section establishes approximate necessary strongly stationary conditions for the IVMOPVC, with the Clarke subdifferential serving as the primary tool. Section 4 explores the conditions under which the necessary strongly stationary conditions derived in the previous section become sufficient for obtaining an approximate solution to the IVMOPVC. We conclude our paper in Section 5. The abbreviations used in this paper are listed in the Abbreviations section at the end of the paper.

2. Preliminaries

In this section, we recall several definitions and preliminary results that will be used throughout the paper.
Let R n be the n-dimensional Euclidean space. For any two vectors x ˇ , z R n , we write x ˇ < z (or x ˇ z ) when x ˇ i < z i (or x ˇ i z i and x ˇ z ) for all i = 1 , , n . The zero vector in R n is represented by 0 R n .
Let Ω be a nonempty subset of R n , the polar cone of Ω , the strict polar cone of Ω , and the orthogonal set to Ω are denoted by Ω , Ω s and Ω , respectively, and are defined as:
Ω : = { x ˇ R n x ˇ , ω 0 , ω Ω } ,
Ω s : = { x ˇ R n x ˇ , ω < 0 , ω Ω } ,
Ω : = { x ˇ R n x ˇ , ω = 0 , ω Ω } ,
where . , . indicates the standard inner product in R n .
We recall that in R n , a polyhedral convex set is defined as the intersection of a finite collection of closed half-spaces. Additionally, a bounded convex set that is generated by a finite number of elements is referred to as a polytope.
The closure of set Ω , its convex cone (containing the origin), the convex hull, and the closed convex cone generated by Ω are denoted by Ω ¯ , c o n e ( Ω ) , c o n v ( Ω ) , and c o n e ¯ ( Ω ) , respectively.
Also, the contigent cone to Ω at ζ Ω ¯ is denoted by
Γ ( Ω , ζ ) : = { d R n | { ( t k , d k ) } ( 0 + , d ) : ζ + t k d k Ω , k N } .
Notice that Γ ( Ω , ζ ) is a closed cone (generally nonconvex) in R n .
Definition 1
([35]). Let h : R n R be a locally Lipschitz function at ζ R n . The Clarke directional derivative of h at ζ in a direction v R n is defined by
h o ( ζ ; v ) : = lim sup z ζ , t 0 h ( z + t v ) h ( z ) t
and the Clarke subdifferential of h at ζ is defined by
h ( ζ ) : = { ζ * R n | ζ * , v h o ( ζ ; v ) , v R n } .
Remark 1.
If the function h is continuously differentiable at ζ , then h ( ζ ) = { h ( ζ ) } . Moreover, if the function h is convex, then the Clarke subdifferential h ( ζ ) coincides with the subdifferential h ( ζ ) in the sense of convex analysis given by
h ( ζ ) : = { ζ * R n | h ( x ˇ ) h ( ζ ) + ζ * , x ˇ ζ , x ˇ R n } .
The proposition below highlights important aspects of the Clarke directional derivative and subdifferential from [35], which we will often use ahead.
Proposition 1
([35]). Let h 1 , h 2 : R n R be functions that are Lipschitz near ζ R n . Then, the following assertions hold:
(a) 
h ( ζ ; v ) = m a x { ζ * , v ζ * h ( ζ ) } f o r a n y v R n ;
(b) 
( α 1 h 1 + α 2 h 2 ) ( ζ ) α 1 h 1 ( ζ ) + α 2 h 2 ( ζ ) , α 1 , α 2 R ;
(c) 
( h 1 h 2 ) ( ζ ) h 1 ( ζ ) h 2 ( ζ ) + h 2 ( ζ ) h 1 ( ζ ) .
Definition 2
(Definition 2.6, [36]). Let K R n be an open convex set. A locally Lipschitz function h : R n R is said to be pseudoconvex at ζ over K R n iff for each x ˇ K one has
h ( x ˇ ) < h ( ζ ) ζ * , x ˇ ζ < 0 , ζ * h ( ζ )
or equivalently
ζ * h ( ζ ) : ζ * , x ˇ ζ 0 h ( x ˇ ) h ( ζ )
The function h is said to be pseudoconcave at ζ over K, iff h is pseudoconvex at ζ over K. The function h : R n R is said to be pseudolinear at ζ over K R n , iff h is both pseudoconvex and pseudoconcave at ζ over K.
Now, consider a multiobjective optimization problem with vanishing constraints as follows:
min f ( x ˇ ) : = ( f 1 ( x ˇ ) , , f p ( x ˇ ) )    s . t . H i ( x ˇ ) 0 , i M , H i ( x ˇ ) G i ( x ˇ ) 0 , i M ,
where the functions f j , H i and G i are locally Lipschitz from R n to R for all i M : = { 1 , , m } and j P : = { 1 , , p } . The feasible set S of the problem MOPVC is defined as
S : = { x ˇ R n H i ( x ˇ ) 0 , H i ( x ˇ ) G i ( x ˇ ) 0 , i M } .
A point ζ S is said to be an efficient solution (or weakly efficient solution) for MOPVC iff there exists no x ˇ S satisfying
f ( x ˇ ) f ( ζ ) ( or f ( x ˇ ) < f ( ζ ) ) .
We borrow the following symbols from [15] to represent the whole of this article.
The index set M can be divided into M = M + M 0 at any ζ S , where
M + : = { i M H i ( ζ ) > 0 } , M 0 : = { i M H i ( ζ ) = 0 } .
Also, the index sets M + and M 0 can be divided as
M + 0 : = { i M + G i ( ζ ) = 0 } , M + : = { i M + G i ( ζ ) < 0 } , M 0 + : = { i M 0 G i ( ζ ) > 0 } , M 00 : = { i M 0 G i ( ζ ) = 0 } , M 0 : = { i M 0 G i ( ζ ) < 0 } .
For each i M , set θ i : = H i G i and for each K M P and ψ { G , H , f , θ } , we have
σ K ψ : = k K ψ k ( ζ ) .
Since H i ( ζ ) = 0 when i M 0 , and θ i ( ζ ) = 0 when i M 0 M + 0 , the classic linearized cone of problem (MOPVC) at ζ is
( σ P f ) ( σ M 0 H ) ( σ M 0 M + 0 θ ) .
Following [15], consider the linearized cone L , where
L : = σ M 0 + H ( σ M 0 H ) σ M + 0 G .
Additionally, for each k P , let P k : = P { k } and
Q k : = S { x ˇ R n f j ( x ˇ ) f j ( ζ ) , j P k } , if p > 1 , S , if p = 1 .
Sadeghieh et al. [15] define the following Abadie type data qualification for (MOPVC).
Definition 3
([15]). The problem (MOPVC) satisfies
  • the Abadie data qualification, denoted by ADQ, at ζ iff
    ( σ P f ) ( σ M 0 H ) ( σ M 0 M + 0 θ ) Γ ( S , ζ ) ;
  • the weak ADQ, denoted by WADQ, at ζ iff
    ( σ P f ) L Γ ( S , ζ ) ;
  • the refined WADQ, denoted by RWADQ, at ζ iff
    ( σ P f ) s L Γ ( S , ζ ) ;
  • the extended ADQ, denoted by EADQ, at ζ iff
    ( σ P f ) L k = 1 p Γ ( Q k , ζ ) .
Lemma 1
(Lemma 1, [15]). The diagram below illustrates the relationships between the data qualifications listed above:
A D Q E A D Q W A D Q R W A D Q
Moreover, when p = 1 A D Q E A D Q .
Definition 4
(Definition 3, [15]). The problem (MOPVC) satisfies Mangasarian-Fromovitiz data qualification, denoted by MFDQ, at ζ iff
(i) 
0 R n i M 0 + α i H i ( ζ ) α i = 0 , i M 0 + ,
(ii) 
( σ P k f ) s ( σ M 0 + H ) ( σ M 00 M 0 H ) s ( σ M + 0 G ) s , k P .
Definition 5
(Definition 4, [15]). The problem (MOPVC) satisfies Mangasarian-Fromovitiz constraint qualification, denoted MFCQ, at ζ iff
(i) 
0 R n i M 0 + α i H i ( ζ ) α i = 0 , i M 0 + ,
(ii) 
( σ M 0 + H ) ( σ M 00 M 0 H ) s ( σ M + 0 G ) s .
Sadeghieh et al. [15] derived the following necessary weak strongly stationary conditions and strong strongly stationary conditions for (MOPVC), respectively.
Theorem 1
(Theorem 2, [15]). Suppose that ζ is a weakly efficient solution for (MOPVC) such that RWADQ holds at ζ . If the cone ( L ) is closed, then there exist scalars λ j f , λ i H , and λ i G for j P and i M , satisfying
0 R n j P λ j f f j ( ζ ) + i M λ i G G i ( ζ ) λ i H H i ( ζ ) ,
λ i H = 0 ( i M + 0 M + ) , λ i H 0 ( i M 0 M 00 ) , λ i H f r e e ( i M 0 + ) ,
λ i G = 0 ( i M 0 M + ) , λ i G 0 ( i M + 0 ) ,
( λ 1 f , , λ p f ) 0 R p , j = 1 p λ j f = 1 .
Theorem 2
(Theorem 4, [15]). Suppose that ζ is an efficient solution for (MOPVC) and EADQ is satisfied at ζ . If f j ( ζ ) , H i ( ζ ) , and G i ( ζ ) for j P and i M are polytopes, then we can find some scalars λ j f , λ i H , and λ i G for j P and i M , such that (1)–(3) hold and
( λ 1 f , , λ p f ) > 0 R p , i = 1 p λ j f = 1 .
Remark 2.
A point ζ S satisfies
  • a weak strongly stationary condition, denoted by W-S-SC, iff there exist scalars satisfying (1)–(4).
  • a strong strongly stationary condition, denoted by S-S-SC, iff there exist scalars satisfying (1)–(3) and (5).
For p = 1 , both the conditions will coincide.
Theorems 3 below shows that MFDQ is sufficient to satisfy Abadie type DQs without assuming M 00 = .
Theorem 3
(Theorem 5, [15]). Suppose that the MFDQ holds at ζ for (MOPVC) and H i is a pseudolinear function for each i M 0 + , then, EADQ also holds at ζ .
Theorem 4 ensures that the MFCQ (resp. MFDQ) is indeed a valid qualification condition, and it leads to the W-S-SC (resp. S-S-SC) at weakly efficient solution of the (MOPVC) when the set M 00 = .
Theorem 4.
Suppose that ζ is a weakly efficient solution for (MOPVC) such that M 00 = . Then,
(a) 
(Theorem 7, [15]) if MFCQ is satisfied at ζ , then W-S-SC also holds at ζ .
(b) 
(Theorem 8, [15]) if MFDQ is satisfied at ζ , then S-S-SC also holds at ζ .
Now, we briefly revisit the essential notations from interval-valued analysis, see e.g., [37,38,39].
Let K c : = { [ s L , s U ] : s L , s U R , s L s U } be the class of all closed and bounded intervals in R . Let S : = [ s L , s U ] and T : = [ t L , t U ] be in K c . Then,
(i)
S + T : = { s + t : s S , t T } = [ s L + t L , s U + t U ] ;
(ii)
S T : = { s t : s S , t T } = [ s L t U , s U t L ] ;
(iii)
for each α R , one has
α S : = { α s : s S } = [ α s L , α s U ] , if α 0 , [ α s U , α s L ] , if α < 0 .
If s L = s U = s , then S = [ s , s ] = { s } .
The different L U -orderings between two intervals are defined as follows:
Definition 6
(Definition 3, [40]). Let S = [ s L , s U ] , T = [ t L , t U ] K c . We say that:
(i) 
S L U T iff s L t L and s U t U ,
(ii) 
S < L U T iff S L U T and S T ,
or, equivalently,
S < L U T iff
s L < t L s U t U o r s L t L s U < t U o r s L < t L s U < t U ,
(iii) 
S < L U s T iff s L < t L and s U < t U .
Now, we consider the following interval-valued multiobjective optimization problem with vanishing constraints:
min F ( x ˇ ) : = ( F 1 ( x ˇ ) , , F p ( x ˇ ) )    s . t . H i ( x ˇ ) 0 , i M H i ( x ˇ ) G i ( x ˇ ) 0 , i M ,
where F j : R n K c , j P are interval-valued functions defined by F j ( x ˇ ) : = [ f j L ( x ˇ ) , f j U ( x ˇ ) ] , where the functions f j L , f j U , H i and G i , i M are locally Lipschitz function from R n to R such that f j L ( x ˇ ) f j U ( x ˇ ) , j P for every x ˇ S . The feasible region of the (IVMOPVC) is denoted by S .
Following Definition 3.1 of [41], we write the concepts of approximate Pareto efficient solutions for the (IVMOPVC) as follows.
Definition 7.
Let E j L , E j U , j P be real-numbers satisfying 0 E j L E j U with E j : = [ E j L , E j U ] for all j P and let E : = ( E 1 , , E p ) . Then, ζ S is a
(i) 
type-1  E -quasi Pareto solution of the IVMOPVC, denoted by ζ E S 1 q , iff there is no x ˇ S such that
F j ( x ˇ ) + E j x ˇ ζ L U F j ( ζ ) , j P ,
and
F r ( x ˇ ) + E r x ˇ ζ < L U F r ( ζ ) , for at least one r P ;
(ii) 
type-2  E -quasi Pareto solution of the IVMOPVC, denoted by ζ E S 2 q , iff there is no x ˇ S such that
F j ( x ˇ ) + E j x ˇ ζ L U F j ( ζ ) , j P ,
and
F r ( x ˇ ) + E r x ˇ ζ < L U s F r ( ζ ) , for at least one r P ;
(iii) 
type-1  E -quasi weakly Pareto solution of the IVMOPVC, denoted by ζ E S 1 q w iff there is no x ˇ S such that
F j ( x ˇ ) + E j x ˇ ζ < L U F j ( ζ ) , j P ;
(iv) 
type-2  E -quasi weakly Pareto solution of the IVMOPVC, denoted by ζ E S 2 q w iff there is no x ˇ S such that
F j ( x ˇ ) + E j x ˇ ζ < L U s F j ( ζ ) , j P .
Remark 3.
If E j = 0 , i.e., for any j P , E j L = E j U = 0 , then the concepts of a type-1 E -quasi Pareto solution, a type-2 E -quasi Pareto solution coincides with a type-1 Pareto solution, a type-2 Pareto solution, respectively, and a type-1 E -quasi-weakly Pareto solution and a type-2 E -quasi-weakly Pareto solution coincides with a type-1 weakly Pareto solution and a type-2 weakly Pareto solution, respectively, which were given by Tung [40].
The following inclusion relations hold:
  • E S 1 q E S 2 q E S 2 q w .
  • E S 1 q E S 1 q w E S 2 q w .
The following result interrelate a type-2 weakly Pareto solution of the (IVMOPVC) with a weakly efficient solution of a multiobjective optimization problem.
Theorem 5
(Lemma 4, [40]). A feasible point ζ S is a type-2 weakly Pareto solution of the (IVMOPVC) iff ζ is a weakly efficient solution of the (MOPVC1) which is given as
min f ( x ˇ ) : = ( f 1 L ( x ˇ ) , , f p L ( x ˇ ) , f 1 U ( x ˇ ) , . . . , f p U ( x ˇ ) ) subject to x ˇ S .

3. Approximate KKT Conditions for IVMOPVC

This section presents the approximate necessary strongly stationary conditions that a feasible point must satisfy to be considered as an approximate solution of problem (IVMOPVC). Here, we extend the results of [15] to the setting of interval-valued objective functions and focus on approximate solutions instead of exact ones. To achieve this, first we introduces several approximate constraint and data qualifications for the problem (IVMOPVC) and examines the relationships among them. Using these qualifications, we establish the approximate necessary strongly stationary conditions for the IVMOPVC, employing the Clarke subdifferential as the main analytical tool.
The notations listed below will be used in the subsequent discussion.
Let E j L , E j U , j P be real-numbers satisfying 0 E j L E j U with E j : = [ E j L , E j U ] for all j P and let E : = ( E 1 , , E p ) K c p . For any ζ S and E K c p , define
σ P , E F L ( ζ ) : = j P ( f j L + E j L · ζ ) ( ζ ) ; σ P , E F U ( ζ ) : = j P ( f j U + E j U · ζ ) ( ζ ) ; σ P k , E F L ( ζ ) : = j P , j k ( f j L + E j L · ζ ) ( ζ ) ; σ P k , E F U ( ζ ) : = j P , j k ( f j U + E j U · ζ ) ( ζ ) .
We introduce approximate version of various data qualifications which will be used to derive approximate KKT conditions for the (IVMOPVC).
Definition 8.
Let ζ S and let E K c p . The (IVMOPVC) satisfies
  • the E -Abadie data qualification, denoted by E -IV-ADQ, at ζ iff
    ( σ P , E F L σ P , E F U ) ( σ M 0 H ) ( σ M 0 M + 0 θ ) Γ ( S , ζ ) ;
  • the weak E -ADQ, denoted by E -IV-WADQ, at ζ iff
    ( σ P , E F L σ P , E F U ) L Γ ( S , ζ ) ;
  • the refined E -WADQ, denoted by E -IV-RWADQ, at ζ iff
    ( σ P , E F L σ P , E F U ) s L Γ ( S , ζ ) ;
  • the extended E -ADQ, denoted by E -IV-EADQ, at ζ iff
    ( σ P , E F L σ P , E F U ) L k = 1 p Γ ( Q k , ζ ) .
Remark 4.
Some special cases are given as follows:
  • If E j L = E j U = 0 for all j P , then (IVMOPVC) satisfies IV-ADQ, IV-WADQ, IV-RWADQ, IV-EADQ, respectively, at ζ .
  • If f j L = f j U = f j for all j P , then (MOPVC) satisfies E -ADQ, E -WADQ, E -RWADQ and E -EADQ, respectively, at ζ.
  • If f j L = f j U = f j and E j L = E j U = 0 for all j P , then (MOPVC) satisfies ADQ, WADQ, RWADQ, EADQ, respectively, at ζ as given by Sadeghieh et al. (Definition 2, [15]).
Remark 5.
It is easy to observe that (IVMOPVC) satisfies E -IV-ADQ, E -IV-WADQ, E -IV-RWADQ, and E -IV-EADQ at ζ S iff ADQ, WADQ, RWADQ, and EADQ, respectively, is satisfied at ζ for the problem E -MOPVC1, which is given by
min ( f 1 L ( x ˇ ) + E 1 L x ˇ ζ , , f p L ( x ˇ ) + E p L x ˇ ζ , f 1 U ( x ˇ ) + E 1 U x ˇ ζ , , f p U ( x ˇ ) + E p U x ˇ ζ ) s . t . H i ( x ˇ ) 0 , i M H i ( x ˇ ) G i ( x ˇ ) 0 , i M .
Remark 6.
Based on Lemma 1, the relation among various approximate data qualifications is given as follows.
E I V A D Q E I V E A D Q E I V W A D Q E I V R W A D Q
Moreover, E I V A D Q E I V E A D Q when p = 1.
Now we give an example where (MOPVC) does not satisfy RWADQ but satisfies E -RWADQ at ζ S for a suitable choice of E .
Example 1.
Consider the following MOPVC:
min f ( x 1 , x 2 ) : = ( f 1 ( x 1 , x 2 ) , f 2 ( x 1 , x 2 ) ) s . t . H 1 ( x 1 , x 2 ) 0 , H 1 ( x 1 , x 2 ) G 1 ( x 1 , x 2 ) 0 ,
where
f 1 ( x 1 , x 2 ) : = | x 1 | x 2 , f 2 ( x 1 , x 2 ) : = x 1 2 x 2 , H 1 ( x 1 , x 2 ) : = x 2 , G 1 ( x 1 , x 2 ) : = x 2 | x 1 | .
At a point ζ = 0 R 2 , one has
f 1 ( ζ ) = [ 1 , 1 ] × { 1 } , f 2 ( ζ ) = { ( 0 , 1 ) } , H 1 ( ζ ) = { ( 0 , 1 ) } , G 1 ( ζ ) = [ 1 , 1 ] × { 1 } , M = M 00 = { 1 } , P = { 1 , 2 } .
Now, observe that
σ P f = j = 1 , 2 f j ( ζ ) = [ 1 , 1 ] × { 1 } , ( σ P f ) s = { ( d 1 , d 2 ) R 2 : d 1 + d 2 > 0 , d 1 d 2 < 0 , d 2 > 0 } , L = σ M 0 + H ( σ M 0 H ) ( σ M + 0 G ) = { ( 0 , 1 ) } = { ( 0 , 1 ) } , L = { ( d 1 , d 2 ) R 2 : d 2 0 } , Γ ( S , ζ ) = { ( d 1 , d 2 ) R 2 : d 2 ( d 2 | d 1 | ) 0 , d 2 0 } ,
and
( σ P f ) s L Γ ( S , ζ ) .
Hence, (MOPVC) does not satisfy RWADQ at ζ as given in (Example 1, [15]).
If we choose E = ( E 1 , E 2 ) = ( 0 , 2 ) , then
( f 1 + E 1 · ζ ) ( ζ ) = [ 1 , 1 ] × { 1 } ,
( f 2 + E 2 · ζ ) ( ζ ) = { ( 0 , 1 ) } + 2 B R 2
and
( σ P , E f ) s = ,
which implies that
( σ P , E f ) s L Γ ( S , ζ ) .
Hence, (MOPVC) satisfies E -RWADQ at ζ .

3.1. Type-2 E -Quasi Weakly Pareto Solutions

In this subsection, we derive an approximate KKT conditions for the (IVMOPVC) by utilizing the approximate data qualifications given in Definition 8.
Theorem 6.
Suppose that ζ E S 2 q w such that E -IV-RWADQ holds at ζ. If the cone( L ) is closed, then there exist scalars λ j f L , λ j f U , λ i H and λ i G for j P and i M satisfying
0 R n j P λ j f L f j L ( ζ ) + j P λ j f U f j U ( ζ ) + i M ( λ i G G i ( ζ ) λ i H H i ( ζ ) ) + j P ( λ j f L E j L + λ j f U E j U ) B R n ,
λ i H = 0 ( i M + 0 M + ) , λ i H 0 ( i M 0 M 00 ) , λ i H free ( i M 0 + ) ,
λ i G = 0 ( i M 0 M + ) , λ i G 0 ( i M + 0 ) ,
( λ 1 f L λ p f L , λ 1 f U λ p f U ) 0 R 2 p , j = 1 p ( λ j f L + λ j f U ) = 1 .
Proof. 
Since ζ E S 2 q w , therefore ζ is a type-2 quasi weakly Pareto solution of the problem E -IVMOPVC , where E -IVMOPVC is given by
min F ( x ˇ ) + E x ˇ ζ : = ( F 1 ( x ˇ ) + E 1 x ˇ ζ , , F p ( x ˇ ) + E p x ˇ ζ ) s . t . H i ( x ˇ ) 0 , i M H i ( x ˇ ) G i ( x ˇ ) 0 , i M .
By Theorem 5, it follows that ζ S is a weakly efficient solution of the ( E -MOPVC1).
Since IVMOPVC satisfies E -IV-RWADQ at ζ , therefore E -IVMOPVC satisfies IV-RWADQ at ζ and hence ( E -MOPVC1) satisfies RWADQ at ζ . By Theorem 1, there exist λ j f L , λ j f U , j P , λ i H , and λ i G , i M such that
0 R n j P λ j f L ( f j L + E j L · ζ ) ( ζ ) + j P λ j f U ( f j U + E j U · ζ ) ( ζ ) + i M ( λ i G G i ( ζ ) λ i H H i ( ζ ) ) ,
λ i H = 0 ( i M + 0 M + ) , λ i H 0 ( i M 0 M 00 ) , λ i H free ( i M 0 + ) ,
λ i G = 0 ( i M 0 M + ) , λ i G 0 ( i M + 0 ) ,
( λ 1 f L λ p f L , λ 1 f U λ p f U ) 0 R 2 p , j = 1 p ( λ j f L + λ j f U ) = 1 .
By the property of the Clarke subdifferentials in Proposition 1, one has
( f j L + E j L · ζ ) ( ζ ) f j L ( ζ ) + E j L · ζ ( ζ )
and
( f j U + E j U · ζ ) ( ζ ) f j U ( ζ ) + E j U · ζ ( ζ ) .
Since the Clarke subdifferential of the norm function | | . ζ | | ( ζ ) = B R n (see (Example 4, p. 198, [42])), we have the required result. □
Note 1.
In many real-life multiobjective problems with vanishing constraints such as supply chain management with uncertain suppliers [43] or investment planning under changing policies [44], uncertainty and variability are unavoidable. Classical exact optimality conditions ( E = 0 ) require perfect precision, which is unrealistic when data is noisy and constraints shift over time. In such cases, insisting on exact solutions may lead to no feasible results. Instead, approximate solutions provide a more practical approach, offering near-optimal decisions under uncertainty.
We now present an example that satisfies the above theorem and demonstrates that, although no point exactly solves the problem, an approximate E -solution does exist and meets the optimality conditions.
Example 2.
Consider an IVMOPVC in R 2 as follows:
min F ( x ˇ ) : = ( F 1 ( x ˇ ) : = [ f 1 L ( x ˇ ) , f 1 U ( x ˇ ) ] , F 2 ( x ˇ ) : = [ f 2 L ( x ˇ ) , f 2 U ( x ˇ ) ] ) s . t . H 1 ( x ˇ ) 0 , H 1 ( x ˇ ) G 1 ( x ˇ ) 0 ,
where x ˇ : = ( x 1 , x 2 ) R 2 and
f 1 L ( x ˇ ) : = | x 1 | + x 2 2 x 1 2 + x 2 2 , f 1 U ( x ˇ ) : = 8 | x 1 | x 2 3 x 1 2 + x 2 2 , f 2 L ( x ˇ ) : = | x 1 | 2 x 2 x 1 2 + x 2 2 , f 2 U ( x ˇ ) : = 3 | x 1 | x 2 2 x 1 2 + x 2 2 . H 1 ( x ˇ ) : = x 2 , G 1 ( x ˇ ) : = x 2 2 | x 1 | .
For ζ = 0 R 2 , the system
f 1 L ( x ˇ ) f 1 L ( ζ ) = | x 1 | + x 2 2 x 1 2 + x 2 2 < 0 , f 1 U ( x ˇ ) f 1 U ( ζ ) = 8 | x 1 | x 2 3 x 1 2 + x 2 2 < 0 , f 2 L ( x ˇ ) f 2 L ( ζ ) = | x 1 | 2 x 2 x 1 2 + x 2 2 < 0 , f 2 U ( x ˇ ) f 2 U ( ζ ) = 3 | x 1 | x 2 2 x 1 2 + x 2 2 < 0 , H 1 ( x ˇ ) = x 2 0 , H 1 ( x ˇ ) G 1 ( x ˇ ) = x 2 ( x 2 2 | x 1 | ) 0 ,
is solvable for some x ˇ R 2 shown by the shaded region in the Figure 1. Since such points exist, the point ζ does not satisfy the required condition of type-2 weakly Pareto solution. Hence, ζ S 2 q w .
Now, if we choose E 1 L = 2 , E 1 U = 3 , E 2 L = 1 , and E 2 U = 2 , then the system
f 1 L ( x ˇ ) f 1 L ( ζ ) + E 1 L x ˇ ζ = | x 1 | + x 2 < 0 , f 1 U ( x ˇ ) f 1 U ( ζ ) + E 1 U x ˇ ζ = 8 | x 1 | x 2 < 0 , f 2 L ( x ˇ ) f 2 L ( ζ ) + E 2 L x ˇ ζ = | x 1 | 2 x 2 < 0 , f 2 U ( x ˇ ) f 2 U ( ζ ) + E 2 U x ˇ ζ = 3 | x 1 | x 2 < 0 , H 1 ( x ˇ ) = x 2 0 , H 1 ( x ˇ ) G 1 ( x ˇ ) = x 2 ( x 2 2 | x 1 | ) 0 .
is not solvable for any x ˇ R 2 . Hence, ζ E S 2 q w . Moreover, it is easy to see that
( f 1 L + E 1 L · ζ ) ( ζ ) = [ 1 , 1 ] × { 1 } , ( f 1 U + E 1 U · ζ ) ( ζ ) = [ 8 , 8 ] × { 1 } , ( f 2 L + E 2 L · ζ ) ( ζ ) = [ 1 , 1 ] × { 2 } , ( f 2 U + E 2 U · ζ ) ( ζ ) = [ 3 , 3 ] × { 1 } , H 1 ( ζ ) = { ( 0 , 1 ) } , G 1 ( ζ ) = [ 2 , 2 ] × { 1 } , M = M 00 = { 1 } , P = { 1 , 2 } ,
and
σ P , E F L ( ζ ) = j P ( f j L + E j L · ζ ) ( ζ ) = [ 1 , 1 ] × { 1 } [ 1 , 1 ] × { 2 } , σ P , E F U ( ζ ) = j P ( f j U + E j U · ζ ) ( ζ ) = [ 8 , 8 ] × { 1 } , L = σ M 0 + H ( σ M 0 H ) ( σ M + 0 G ) = { ( 0 , 1 ) } , Γ ( S , ζ ) = { ( d 1 , d 2 ) R 2 : d 2 ( d 2 2 | d 1 | ) 0 , d 2 0 } ,
which implies that
= ( σ P , E F L ( ζ ) σ P , E F U ( ζ ) ) s L Γ ( S , ζ ) .
Therefore, E -IV-RWADQ is satisfied at ζ = 0 R 2 for IVMOPVC.
By taking λ 1 L = 1 , λ 1 U = 0 , λ 2 L = 0 , λ 2 U = 0 , λ 1 G = 0 , λ 1 H = 1 , we get
0 R 2 j = 1 2 λ j f L ( f j L + E j L · ζ ) ( ζ ) + j = 1 2 λ j f U ( f j U + E j U · ζ ) ( ζ ) + ( λ 1 G G 1 ( ζ ) λ 1 H H 1 ( ζ ) ) , = 1 ( [ 1 , 1 ] × { 1 } ) 1 { ( 0 , 1 ) } ,
which verifies Theorem 6.
A corollary of Theorem 6 with E j L = E j U = 0 for every j P is given as follows:
Corollary 1.
Suppose that ζ S 2 q w such that IV-RWADQ holds at ζ. If the cone( L ) is closed, then there exist scalars λ j f L , λ j f U , λ i H and λ i G for j P and i M satisfying
0 R n j P λ j f L f j L ( ζ ) + j P λ j f U f j U ( ζ ) + i M ( λ i G G i ( ζ ) λ i H H i ( ζ ) )
with (7)–(9).
Here, E j L = E j U = 0 for every j P , that is, j P λ j f L E j L + λ j f U E j U B R n = 0 . Therefore, the conditions represent exact weak strongly stationarity for (IVMOPVC) rather than approximate ones.
For f j L = f j U = f j for every j P , a corollary of Theorem 6 is given as follows:
Corollary 2.
Suppose that ζ is a E weakly efficient solution for (MOPVC) such that E -RWADQ holds at ζ . If the cone ( L ) is closed, then there exist scalars λ j f , λ i H , and λ i G for j P and i M , satisfying
0 R n j P λ j f f j ( ζ ) + i M ( λ i G G i ( ζ ) λ i H H i ( ζ ) ) + j P λ j f E j B R n
with (7) and (8) and
( λ 1 f λ p f ) 0 R p , j = 1 p λ j f = 1 .
Here, f j L = f j U = f j for every j P , that is, j P λ j f L f j L ( ζ ) = j P λ j f U f j U ( ζ ) = j P λ j f f j ( ζ ) and ( λ 1 f L λ p f L , λ 1 f U λ p f U ) = ( λ 1 f λ p f ) . Therefore, the conditions represent the approximate weak strongly stationarity conditions for (MOPVC).
The following example illustrates the Corollary 2.
Example 3.
Consider an MOPVC in R 2 as follows:
min f ( x ˇ ) : = ( f 1 ( x ˇ ) , f 2 ( x ˇ ) ) s . t . H 1 ( x ˇ ) 0 , H 1 ( x ˇ ) G 1 ( x ˇ ) 0
where
f 1 ( x ˇ ) : = 2 x 1 2 x 2 x 1 2 + x 2 2 , f 2 ( x ˇ ) : = x 1 2 + 2 x 2 2 x 1 2 + x 2 2 . H 1 ( x ˇ ) : = x 2 , G 1 ( x ˇ ) : = x 2 2 | x 1 | .
For ζ = 0 R 2 , the system
f 1 ( x ˇ ) f 1 ( ζ ) = 2 x 1 2 x 2 x 1 2 + x 2 2 < 0 , f 2 ( x ˇ ) f 2 ( ζ ) = x 1 2 + 2 x 2 2 x 1 2 + x 2 2 < 0 , H 1 ( x ˇ ) = x 2 0 , H 1 ( x ˇ ) G 1 ( x ˇ ) = x 2 ( x 2 2 | x 1 | ) 0 ,
is solvable for some x ˇ R 2 shown by the shaded region in the Figure 2. Since such points exist, the point ζ does not satisy the required condition of weakly efficient solution. Hence, ζ is not a weakly efficient solution of the given problem MOPVC.
Now, if we choose E 1 = 1 , and E 2 = 2 , then ζ is E weakly efficient solution of the problem MOPVC as the system
f 1 ( x ˇ ) f 1 ( ζ ) + E 1 x ˇ ζ = 2 x 1 2 x 2 < 0 , f 2 ( x ˇ ) f 2 ( ζ ) + E 2 x ˇ ζ = x 1 2 + 2 x 2 < 0 , H 1 ( x ˇ ) = x 2 0 , H 1 ( x ˇ ) G 1 ( x ˇ ) = x 2 ( x 2 2 | x 1 | ) 0 ,
is not solvable for any x ˇ R 2 . Moreover, it is easy to see that
( f 1 + E 1 · ζ ) ( ζ ) = { ( 0 , 1 ) } , ( f 2 + E 2 · ζ ) ( ζ ) = { ( 0 , 2 ) } , H 1 ( ζ ) = { ( 0 , 1 ) } , G 1 ( ζ ) = [ 2 , 2 ] × { 1 } , M = M 00 = { 1 } , P = { 1 , 2 } ,
and
σ P , E f ( ζ ) = j P ( f j + E j · ζ ) ( ζ ) = { ( 0 , 1 ) } { ( 0 , 2 ) } , L = σ M 0 + H ( σ M 0 H ) ( σ M + 0 G ) = { ( 0 , 1 ) } , Γ ( S , ζ ) = { ( d 1 , d 2 ) R 2 : d 2 ( d 2 2 | d 1 | ) 0 , d 2 0 } ,
which implies that
= ( σ P , E f ( ζ ) ) s L Γ ( S , ζ ) .
Therefore, E -RWADQ is satisfied at ζ = 0 R 2 for MOPVC.
By taking λ 1 = 0 , λ 2 = 1 , λ 1 G = 0 , λ 1 H = 2 , we get
0 R 2 j = 1 2 λ j f ( f j + E j · ζ ) ( ζ ) + ( λ 1 G G 1 ( ζ ) λ 1 H H 1 ( ζ ) ) . = 1 { ( 0 , 2 ) } 2 { ( 0 , 1 ) } ,
which verifies Corollary 2.

3.2. Type-1 E -Quasi Pareto Solutions

In this subsection, first we give a relation to interrelate an efficient solution of (MOPVC1) and a type-1 Pareto solution of (IVMOPVC).
Theorem 7.
A point ζ S is a type-1 Pareto solution of the (IVMOPVC) iff ζ is an efficient solution of the (MOPVC1).
Proof. 
Let ζ be a type-1 Pareto solution of the (IVMOPVC). Then, there is no x ˇ S satisfying
F j ( x ˇ ) L U F j ( ζ ) , j P ,
and
F r ( x ˇ ) < L U F r ( ζ ) , for at least one r P ;
or equivalently
f j L ( x ˇ ) f j L ( ζ ) , f j U ( x ˇ ) f j U ( ζ ) , j P
and for at least one r P , one has
f r L ( x ˇ ) f r L ( ζ ) f r U ( x ˇ ) < f r U ( ζ ) o r f r L ( x ˇ ) < f r L ( ζ ) f r U ( x ˇ ) f r U ( ζ ) o r f r L ( x ˇ ) < f r L ( ζ ) f r U ( x ˇ ) < f r U ( ζ ) .
Contrarily suppose that ζ is not an efficient solution of the (MOPVC1). Then, there is x ^ S such that
f ( x ^ ) f ( ζ ) ,
or equivalently,
f j L ( x ^ ) f j L ( ζ ) , f j U ( x ^ ) f j U ( ζ ) , j P
and for at least one r P
either f r L ( x ^ ) < f r L ( ζ ) or f r U ( x ^ ) < f r U ( ζ ) ,
which is a contradiction with (22).
Conversely, let ζ be an efficient solution of the (MOPVC1). Then, there is no x ˇ S such that
f j ( x ˇ ) f j ( ζ ) , j P ,
with strict inequality for at least one j P . Suppose to the contrary that ζ is not a type-1 Pareto solution of the (IVMOPVC). Then, there exists x ^ S satisfying
F j ( x ^ ) L U F j ( ζ ) , j P ,
and
F r ( x ^ ) < L U F r ( ζ ) , for at least one r P ;
or equivalently,
f j L ( x ^ ) f j L ( ζ ) , f j U ( x ^ ) f j U ( ζ ) , j P
and for at least one r P , one has
f r L ( x ^ ) f r L ( ζ ) f r U ( x ^ ) < f r U ( ζ ) o r f r L ( x ^ ) < f r L ( ζ ) f r U ( x ^ ) f r U ( ζ ) o r f r L ( x ^ ) < f r L ( ζ ) f r U ( x ^ ) < f r U ( ζ ) ,
which contradicts (23). □
Now, we state an approximate KKT condition to identify type-1  E quasi Pareto solution of the (IVMOPVC) under E -IV-EADQ.
Theorem 8.
Suppose that ζ E S 1 q such that E -IV-EADQ holds at ζ. If ( f j L + E j L · ζ ) ( ζ ) , ( f j U + E j U · ζ ) ( ζ ) , H i ( ζ ) , and G i ( ζ ) for j P and i M are polytopes, then there exist scalars λ j f L , λ j f U , λ i H , and λ i G for j P and i M , such that (6)–(8) hold and
( λ 1 f L , , λ p f L , λ 1 f U , λ p f U ) > 0 R 2 p , j = 1 p ( λ j f L + λ j f U ) = 1 .
Proof. 
Since ζ E S 1 q , therefore ζ S 1 q for the problem ( E -IVMOPVC). Hence by Theorem 7 ζ is an efficient solution of the ( E -MOPVC1). Moreover, since E -IV-EADQ is satisfied at ζ for (IVMOPVC), therefore IV-EADQ is satisfied at ζ for ( E -IVMOPVC) and hence EADQ is satisfied at ζ for ( E -MOPVC1). Further, since ( f j L + E j L · ζ ) ( ζ ) , ( f j U + E j U · ζ ) ( ζ ) , H i ( ζ ) and G i ( ζ ) for j P and i M are polytopes, therefore by Theorem 2, there exist scalars λ j f L , λ j f U , λ i H , and λ i G for j P and i M such that (10)–(12) hold along with (24). The remaining part of the proof is similar to the proof of Theorem 6 and hence the result. □
Remark 7.
A point ζ S satisfies
  • an approximate weak strongly stationary condition for the (IVMOPVC), denoted by  E IV-W-S-SC, iff there exist scalars satisfying (6)–(9).
  • A point ζ S satisfies an approximate strong strongly stationary condition, denoted by  E IV-S-S-SC, iff there exist scalars satisfying (6)–(8) and (24).
For p = 1 , both the conditions will coincide.
A corollary of the Theorem 8 with E j L = E j U = 0 for every j P is given as follows:
Corollary 3.
Suppose that ζ S 1 q such that IV-EADQ holds at ζ. If f j L ( ζ ) , f j U ( ζ ) , H i ( ζ ) , and G i ( ζ ) for j P and i M are polytopes, then there exist scalars λ j f L , λ j f U , λ i H , and λ i G for j P and i M , such that (7) and (8) along with (16) and (24) hold.
Remark 8.
If E j L = E j U = 0 for every j P , then a point ζ S satisfies
  • a weak strongly stationary condition for the (IVMOPVC), denoted by IV-W-S-SC, iff there exist scalars satisfying (7)–(9) along with (16).
  • a strong strongly stationary condition for (IVMOPVC), denoted by IV-S-S-SC, iff there exist scalars satisfying (7) and (8) along with (16) and (24).
For p = 1 , both the conditions will coincide.
For f j L = f j U = f j for every j P , a corollary of Theorem 8 is given as follows:
Corollary 4.
Suppose that ζ is a E efficient solution for (MOPVC) such that E -EADQ holds at ζ . If ( f j + E j · ζ ) ( ζ ) , H i ( ζ ) , and G i ( ζ ) for j P and i M are polytopes, then there exist scalars λ j f , λ i H , and λ i G for j P and i M , such that (7) and (8) along with (17) hold and
( λ 1 f , , λ p f ) > 0 R p , j = 1 p λ j f = 1 .
Remark 9.
If f j L = f j U = f j for every j P , then a point ζ S satisfies
  • an approximate weak strongly stationary condition for the (MOPVC), denoted by  E -W-S-SC, iff there exist scalars satisfying (7) and (8) along with (17) and (18).
  • an approximate strong strongly stationary condition for (MOPVC), denoted by  E -S-S-SC, iff there exist scalars satisfying (7) and (8) along with (17) and (25).
For p = 1 , both the conditions will coincide.
We are now going to introduce an approximate version of the Mangasarian-Fromovitiz data qualification for the (IVMOPVC), denoted by E -IV-MFDQ as follows:
Definition 9.
We say that the E -IV-MFDQ is satisfied at ζ iff
(i) 
0 R n i M 0 + α i H i ( ζ ) α i = 0 , i M 0 + ,
(ii) 
( σ P k , E f L σ P , E f U ) s ( σ M 0 + H ) ( σ M 00 M 0 H ) s ( σ M + 0 G ) s , k P ,
( σ P , E f L σ P k , E f U ) s ( σ M 0 + H ) ( σ M 00 M 0 H ) s ( σ M + 0 G ) s , k P .
Remark 10.
The E -IV-MFDQ is satisfied at ζ for (IVMOPVC) iff MFDQ is satisfied at ζ for ( E -MOPVC1) .
Remark 11.
Some special cases are given as follows:
  • If E j L = E j U = 0 for all j P , then (IVMOPVC) satisfies IV-MFDQ at ζ .
  • If f j L = f j U = f j for all j P , then (MOPVC) satisfies E -MFDQ at ζ.
  • If f j L = f j U = f j and E j L = E j U = 0 for all j P , then (MOPVC) satisfies MFDQ at ζ as given by Sadeghieh et al. (Definition 2, [15]).
Now we give an example where MFDQ is not satisfied for the (MOPVC) at ζ , but E -MFDQ is satisfied at ζ .
Example 4.
Consider the following MOPVC:
min f ( x 1 , x 2 ) = f 1 ( x 1 , x 2 ) , f 2 ( x 1 , x 2 ) s . t . H 1 ( x 1 , x 2 ) 0 , H 1 ( x 1 , x 2 ) G 1 ( x 1 , x 2 ) 0 ,
where
f 1 ( x 1 , x 2 ) = | x 1 | x 2 , f 2 ( x 1 , x 2 ) = x 1 2 x 2 + 2 x 1 2 + x 2 2 , H 1 ( x 1 , x 2 ) = x 2 , G 1 ( x 1 , x 2 ) = x 2 | x 1 | .
At a point ζ = 0 R 2 , one has
f 1 ( ζ ) = [ 1 , 1 ] × { 1 } , f 2 ( ζ ) = { ( 0 , 1 ) } + 2 B R 2 , H 1 ( ζ ) = { ( 0 , 1 ) } , G 1 ( ζ ) = [ 1 , 1 ] × { 1 } , M = M 00 = { 1 } , P = { 1 , 2 } .
Now, observe that
σ P 1 f = f 2 ( ζ ) = { ( 0 , 1 ) } + 2 B R 2 , σ P 2 f = f 1 ( ζ ) = [ 1 , 1 ] × { 1 } , ( σ P 1 f ) s = , ( σ P 2 f ) s = { ( d 1 , d 2 ) R 2 : d 1 + d 2 > 0 , d 1 d 2 < 0 , d 2 > 0 } , ( σ M 00 M 0 H ) = { ( 0 , 1 ) } , ( σ M 00 M 0 H ) s = { ( d 1 , d 2 ) R 2 : d 2 > 0 } ,
Observe that
( σ P 1 f ) s ( σ M 00 M 0 H ) s = .
Hence, MFDQ doesn’t hold at ζ .
If we take E = ( E 1 , E 2 ) = ( 0 , 2 ) , then
( f 1 + E 1 · ζ ) ( ζ ) = [ 1 , 1 ] × { 1 } , ( f 2 + E 2 · ζ ) ( ζ ) = { ( 0 , 1 ) } , ( σ P 1 , E f ) s = { ( x 1 , x 2 ) R 2 : x 2 > 0 } , ( σ P 2 , E f ) s = ( σ P 2 f ) s .
Moreover,
( σ P 1 , E f ) s ( σ M 00 M 0 H ) s ,
( σ P 2 , E f ) s ( σ M 00 M 0 H ) s .
Hence E -MFDQ satisfied at ζ .
Theorem 9 shows that E -IV-MFDQ is sufficient to satisfy E Abadie type DQs without assuming M 00 = .
Theorem 9.
Suppose that the E -IV-MFDQ holds at ζ for (IVMOPVC) and H i is a pseudolinear function for each i M 0 + , then, E -IV-EADQ also holds at ζ .
Proof. 
Since the E –IV–MFDQ holds at ζ for problem (IVMOPVC), it follows from Remark 10 that MFDQ also holds at ζ for problem ( E -MOPVC1). Further, as each H i is a pseudolinear function for all i M 0 + , Theorem 3 implies that EADQ holds at ζ for ( E -MOPVC1). Hence, by Remark 5, the E –IV–EADQ also holds at ζ for (IVMOPVC).□
The following connections exist among the discussed qualification conditions:
E I V M F D Q ( T h e o r e m 9 ) E I V E A D Q ( R e m a r k 6 ) E I V W A D Q ( R e m a r k 6 ) E I V R W A D Q ( R e m a r k 6 ) E I V A D Q
Theorem 10 (resp. Theorem 11) ensures that the MFCQ (resp. E -IV-MFDQ) is indeed a valid qualification condition, and it leads to the E W-S-SC (resp. E S-S-SC) at E quasi Pareto solution of the (IVMOPVC) when the set M 00 = .
Theorem 10.
Suppose that ζ E S 2 q w such that MFCQ holds at ζ. If M 00 = , there exist scalars λ j f L , λ j f U , λ i H and λ i G , for j P and i M , such that E IV-W-S-SC holds.
Proof. 
Since ζ E S 2 q w , it follows that ζ S 2 q w for the problem ( E -IVMOPVC). Hence, by Theorem 5, ζ is an efficient solution of ( E -MOPVC1). Moreover, since the MFCQ is satisfied at ζ for (IVMOPVC), it is also satisfied at ζ for ( E -MOPVC1) by the definition of MFCQ. Further, as M 00 = , Theorem 4(a) ensures the existence of scalars λ j f L , λ j f U , λ i H , and λ i G for j P and i M such that the W-S-SC hold for ( E -MOPVC1), that is, (10)–(13) are satisfied. The remaining part of the proof follows in the same manner as the proof of Theorem 6, and hence the result is established.□
Theorem 11.
Suppose that ζ E S 2 q w such that E -IV-MFDQ holds at ζ. If M 00 = , there exist scalars λ j f L , λ j f U , λ i H and λ i G , for j P and i M , such that E IV-S-S-SC holds.
Proof. 
Since ζ E S 2 q w , it follows that ζ S 2 q w for the problem ( E -IVMOPVC). Hence, by Theorem 5, ζ is an efficient solution of ( E -MOPVC1). Moreover, since E -IV-MFDQ is satisfied at ζ for (IVMOPVC), therefore by remark 10 IV-MFDQ is satisfied at ζ for ( E -IVMOPVC) and hence MFDQ is satisfied at ζ for ( E -MOPVC1). Further, as M 00 = , Theorem 4(b) ensures the existence of scalars λ j f L , λ j f U , λ i H , and λ i G for j P and i M such that the S-S-SC hold for ( E -MOPVC1), that is, (10)–(12) hold along with (24). The remaining part of the proof follows in the same manner as the proof of Theorem 6, and hence the result is established.□

4. Sufficient Optimality Conditions for Approximate Stationary Points

In this section, we derive sufficient conditions for an approximate stationary point to be an approximate Pareto efficient solution for (IVMOPVC). To support our results, we present an example and state several corollaries obtained by considering different conditions in the sufficient conditions.
The following approximate generalized convexity assumptions from [45,46] will be helpful to identify an approximate Pareto efficient solution for (IVMOPVC).
Definition 10.
Let ϵ 0 . A locally Lipschitz function h : R n R is said to be
(a) 
ϵ pseudoconvex at ζ S R n iff the function ϕ : = h + ϵ · ζ is pseudoconvex at ζ , i.e., for every x ˇ R n and x ˇ ζ , one has
ϕ ( x ˇ ) < ϕ ( ζ ) ζ ϕ * , x ˇ ζ < 0 , ζ ϕ * ϕ ( ζ ) ;
(b) 
ϵ quasiconvex at ζ S R n iff the function ϕ : = h + ϵ · ζ is quasiconvex at ζ i.e., if for every x ˇ R n , one has
ϕ ( x ˇ ) ϕ ( ζ ) ζ ϕ * , x ˇ ζ 0 , ζ ϕ * ϕ ( ζ ) ,
where ϕ ( ζ ) is the Clarke subdifferential of ϕ at ζ ,
Now, let ζ S is satisfied in E S-S-SC or E W-S-SC with corresponding multipliers λ j f L , λ j f U , λ i H , and λ i G . The following index sets will be utilize in this section:
M 00 + : = { i M 00 λ i H > 0 } . M 00 0 : = { i M 00 λ i H = 0 } . M 0 + : = { i M 0 λ i H > 0 } . M 0 0 : = { i M 0 λ i H = 0 } . M 0 + + : = { i M 0 + λ i H > 0 } . M 0 + : = { i M 0 + λ i H < 0 } . M 0 + 0 : = { i M 0 + λ i H = 0 } . M + 0 0 + : = { i M + 0 λ i H = 0 , λ i G > 0 } . M + 0 00 : = { i M + 0 λ i H = 0 , λ i G = 0 } .
In fact, one can write
M 00 = M 00 + M 00 0 , M 0 = M 0 + M 0 0 . M + 0 = M + 0 0 + M + 0 00 , M 0 + = M 0 + + M 0 + M 0 + 0 .
The following theorems demonstrate that E IV-W-S-SC and E IV-S-S-SC serve as sufficient optimality conditions for identifying an approximate Pareto efficient solution under the assumptions of approximate pseudoconvexity and quasiconvexity.
Theorem 12.
Let 0 E j L E j U . Suppose that there exist multipliers λ j f L , λ j f U , λ i H and λ i G such that E IV-W-S-SC is satisfied at ζ S . Furthermore, assume that G i ( i M + 0 0 + ) , H i ( i M 0 + ) , H i ( i M 0 + + M 00 + M 0 + ) are quasiconvex at ζ and f j L , f j U are E j L pseudoconvex, E j U pseudoconvex at ζ for j P , r e s p e c t i v e l y .
(i) 
Then ζ is a locally type-2  E quasi weakly Pareto solution for (IVMOPVC).
(ii) 
If M 0 + M + 0 0 + = , then ζ is a type-2  E quasi weakly Pareto solution for (IVMOPVC).
Proof. 
(i)
Firstly, we mention that the continuity of functions G i ( i M 0 + ) and H i ( i M + 0 ) implies the existence of two neighbourhoods C and D for ζ such that
G i ( x ˇ ) > 0 , H i ( x ˇ ) = 0 , x ˇ S C , i M 0 + , H i ( x ˇ ) > 0 , G i ( x ˇ ) 0 , x ˇ S D , i M + 0 .
Secondly, since ζ S is satisfied E IV-W-S-SC therefore, there exist some χ j f L ( f j L + E j L · ζ ) ( ζ ) , χ j f U ( f j U ( ζ ) + E j U · ζ ) ( ζ ) for j P , χ i H H i ( ζ ) for i M 0 and χ i G G i ( ζ ) for i M + 0 , such that
j P λ j f L χ j f L + j P λ j f U χ j f U + i M 0 λ i H χ i H + i M + 0 λ i G χ i G = 0 R n .
Now, assume on the contrary that ζ is not a local type-2 E quasi weakly Pareto solution for (IVMOPVC). Thus, there exists x ^ S C D such that
F ( x ^ ) + E x ^ ζ < L U s F ( ζ ) .
Given that f j L , j P and f j U , j P are E j L pseudoconvex and E j U pseudoconvex at ζ , respectively, then
χ j f L , x ^ ζ < 0 , χ j f L ( f j L + E j L · ζ ) ( ζ ) , j P ,
χ j f U , x ^ ζ < 0 , χ j f U ( f j U + E j U · ζ ) ( ζ ) , j P .
From this and (9) we conclude that
j P λ j f L χ j f L , x ^ ζ < 0 , χ j f L ( f j L + E j L · ζ ) ( ζ ) , j P ,
j P λ j f U χ j f U , x ^ ζ < 0 , χ j f U ( f j U + E j U · ζ ) ( ζ ) , j P .
and hence
i M 0 λ i H χ i H , x ^ ζ + i M + 0 λ i G χ i G , x ^ ζ > 0 ,
by (28). Also, the quasiconvexity of G i ( i M + 0 0 + ) and H i ( i M 0 + ) functions and (27) deduce that:
G i ( x ^ ) 0 = G i ( ζ ) χ i G , x ^ ζ 0 , i M + 0 0 + ,
H i ( x ^ ) = 0 = H i ( ζ ) χ i H , x ^ ζ 0 , i M 0 + .
On the other hand, since H i ( x ^ ) 0 = H i ( ζ ) and χ i H ( H i ) ( ζ ) for i M 0 + + M 00 + M 0 + , the quasiconvexity of H i implies that
χ i H , x ^ ζ 0 , i M 0 + + M 00 + M 0 + .
Involving (26), we get the following four inequalities:
i M 0 + λ i H χ i H , x ^ ζ = i M 0 + + λ i H > 0 χ i H , x ^ ζ 0 by ( 32 ) + i M 0 + λ i H < 0 χ i H , x ^ ζ 0 by ( 31 ) + i M 0 + 0 λ i H = 0 χ i H , x ^ ζ 0 ,
i M 00 λ i H χ i H , x ^ ζ = i M 00 + λ i H > 0 χ i H , x ^ ζ 0 by ( 32 ) + i M 00 0 λ i H = 0 χ i H , x ^ ζ 0 ,
i M 0 λ i H χ i H , x ^ ζ = i M 0 + λ i H > 0 χ i H , x ^ ζ 0 by ( 32 ) + i M 0 0 λ i H = 0 χ i H , x ^ ζ 0 ,
and
i M + 0 λ i G χ i G , x ^ ζ = i M + 0 0 + λ i G > 0 χ i G , x ^ ζ 0 by ( 30 ) + i M + 0 00 λ i G = 0 χ i G , x ^ ζ 0 .
Since M 0 = M 0 + M 00 M 0 , adding these four inequalities, we deduce that
i M 0 λ i H χ i H , x ^ ζ + i M + 0 λ i G χ i G , x ^ ζ 0 ,
which contradicts (29). This contradiction proves (i).
(ii)
By assumption of M 0 + M + 0 0 + = , we can remove the neighbourhoods C and D from the proof of (i), which will allow us to obtain the desired result.
Example 5.
In Example 2, Observe that
  • ζ = ( 0 , 0 ) is a E IV- weak strongly stationary point with M = M 00 = { 1 } , and other indexing are empty.
  • H 1 ( 1 M 00 + ) is quasiconvex at ζ .
  • for E 1 L = 2 , E 1 U = 3 , E 2 L = 1 , and E 2 U = 2 the functions f 1 L is E 1 L pseudoconvex, f 1 U is E 1 U pseudoconvex, f 2 L is E 2 L pseudoconvex, f 2 U is E 2 U pseudoconvex.
Hence by Theorem 12, ζ is a locally type-2  E quasi weakly Pareto solution for the given problem. Also, since M 0 + M + 0 0 + = therefore ζ is a type-2  E quasi weakly Pareto solution for the given problem.
A corollary of the Theorem 12 for E j L = E j U = 0 for every j P is given as follows:
Corollary 5.
Suppose that there exist multipliers λ j f L , λ j f U , λ i H and λ i G such that IV-W-S-SC is satisfied at ζ S . Furthermore, assume that G i ( i M + 0 0 + ) , H i ( i M 0 + ) , H i ( i M 0 + + M 00 + M 0 + ) are quasiconvex at ζ and f j L , f j U are pseudoconvex at ζ for j P .
(i) 
Then ζ is a locally type-2-quasi weakly Pareto solution for (IVMOPVC).
(ii) 
If M 0 + M + 0 0 + = , then ζ is a type-2-quasi weakly Pareto solution for (IVMOPVC).
For f j L = f j U = f j for every j P , a corollary of Theorem 12 is given as follows:
Corollary 6.
Let 0 E j L E j U . Suppose that there exist multipliers λ j f , λ i H and λ i G such that E W-S-SC is satisfied at ζ S . Furthermore, assume that G i ( i M + 0 0 + ) , H i ( i M 0 + ) , H i ( i M 0 + + M 00 + M 0 + ) are quasiconvex at ζ and f j are E j pseudoconvex at ζ for j P , r e s p e c t i v e l y .
(i) 
Then ζ is a locally E weakly efficient solution for (MOPVC).
(ii) 
If M 0 + M + 0 0 + = , then ζ is a E weakly efficient solution for (MOPVC).
The proof of the following sufficient condition is similar to that of Theorem 12, therefore, it is omitted here.
Theorem 13.
Let 0 E j L E j U . Suppose that there exist multipliers λ j f L , λ j f U , λ i H and λ i G such that E IV-S-S-SC is satisfied at ζ S . Furthermore, assume that G i ( i M + 0 0 + ) , H i ( i M 0 + ) , H i ( i M 0 + + M 00 + M 0 + ) are quasiconvex at ζ and f j L , f j U are E j L pseudoconvex, E j U pseudoconvex at ζ for j P , r e s p e c t i v e l y .
(i) 
Then ζ is a locally type-1  E quasi Pareto solution for (IVMOPVC).
(ii) 
If M 0 + M + 0 0 + = , then ζ is a type-1  E quasi Pareto solution for (IVMOPVC).

5. Conclusions

In this paper, we consider a nonsmooth interval-valued multiobjective optimization problem with vanishing constraints (IVMOPVC). We derive approximate versions of some CQs given in [15] for (IVMOPVC), and use them to establish approximate necessary strongly stationary conditions. Further, by employing approximate generalized convexity assumptions, we obtain approximate strongly sufficient conditions. The results presented here extend those in [15], and several corollaries are provided to highlight the relationships between our findings and the existing results. The theoretical developments are well supported by examples. The results of this paper can be applied to other types of optimization problems, such as: semidefinite programming [34] with interval-valued objective functions, robust (MOPVC) under data uncertainity [47] with interval-valued objective functions, robust multiobjective fractional semi-infinite programming [48] with interval-valued objective functions, interval-valued multiobjectiv problems based on convex cones [49] and other related problems. Moreover, it would be an interesting research problem to investigate constraint qulifications and optimality conditions for (IVMOPVC) in the framework of Hadamard manifold [50].

Author Contributions

Conceptualization, A.D., V.L., M.-M.B. and A.-D.H.; Methodology, A.D., V.L., M.-M.B. and A.-D.H.; Formal analysis, A.D.; Investigation, A.D., V.L., M.-M.B. and A.-D.H.; Writing—original draft, A.D., V.L., M.-M.B. and A.-D.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research of the first author is supported by the Joint CSIR-UGC Junior Research Fellowship funded by University Grants Commission, India via NTA reference No. 201610153253.

Data Availability Statement

The authors affirm that data sharing does not apply to this article since no datasets were generated or analyzed during the current study.

Conflicts of Interest

The authors declare that there are no actual or potential conflicts of interest in relation to this article.

Abbreviations

The following abbreviations are used in this manuscript:
CQConstraint Qualification
DQData Qualification
MOPVCMultiobjective optimization problem with vanishing constraints
IVMOPVCInterval-valued multiobjective optimization problem with vanishing constraints
ADQAbadie data qualification
WADQWeak Abadie data qualification
RWADQRefined weak Abadie data qualification
EADQExtended Abadie data qualification
MFDQMangasarian-Fromovitiz data qualification
MFCQMangasarian-Fromovitiz constraint qualification
W-S-SCWeak strongly stationary condition for (MOPVC)
S-S-SCStrong strongly stationary condition for (MOPVC)
E -IV-ADQ E Abadie data qualification for (IVMOPVC)
E -IV-WADQWeak E Abadie data qualification for (IVMOPVC)
E -IV-RWADQRefined E weak Abadie data qualification for (IVMOPVC)
E -IV-EADQExtended E Abadie data qualification for (IVMOPVC)
E -IV-MFDQ E Mangasarian-Fromovitiz data qualification for (IVMOPVC)
E -IV-W-S-SCApproximate weak strongly stationary condition for (IVMOPVC)
E -IV-S-S-SCApproximate strong strongly stationary condition for (IVMOPVC)

References

  1. Achtziger, W.; Kanzow, C. Mathematical programs with vanishing constraints: Optimality conditions and constraint qualifications. Math. Program. 2008, 114, 69–99. [Google Scholar] [CrossRef]
  2. Luo, Z.Q.; Pang, J.S.; Ralph, D. Mathematical Programs with Equilibrium Constraints; Cambridge University Press: Cambridge, UK, 1996. [Google Scholar]
  3. Outrata, J.; Kocvara, M.; Zowe, J. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints: Theory, Applications and Numerical Results; Springer Science & Business Media: Berlin, Germany, 1998; Volume 28. [Google Scholar]
  4. Laha, V.; Singh, H.N. On quasidifferentiable mathematical programs with equilibrium constraints. Comput. Manag. Sci. 2023, 20, 30. [Google Scholar] [CrossRef]
  5. Laha, V.; Pandey, L. On Mathematical Programs with Equilibrium Constraints Under Data Uncertainty. In International Conference on Nonlinear Applied Analysis and Optimization; Springer Nature: Singapore, 2021; pp. 283–300. [Google Scholar]
  6. Hoheisel, T.; Kanzow, C. On the Abadie and Guignard constraint qualifications for mathematical programmes with vanishing constraints. Optimization 2009, 58, 431–448. [Google Scholar] [CrossRef]
  7. Izmailov, A.F.; Pogosyan, A.L. Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints. Comput. Math. Math. Phys. 2009, 49, 1128–1140. [Google Scholar] [CrossRef]
  8. Dorsch, D.; Shikhman, V.; Stein, O. Mathematical programs with vanishing constraints: Critical point theory. J. Glob. Optim. 2012, 52, 591–605. [Google Scholar] [CrossRef]
  9. Achtziger, W.; Hoheisel, T.; Kanzow, C. A smoothing-regularization approach to mathematical programs with vanishing constraints. Comput. Optim. Appl. 2013, 55, 733–767. [Google Scholar] [CrossRef]
  10. Hu, Q.; Wang, J.; Chen, Y. New dualities for mathematical programs with vanishing constraints. Ann. Oper. Res. 2020, 287, 233–255. [Google Scholar] [CrossRef]
  11. Joshi, B.C. Mathematical programs with vanishing constraints involving strongly invex functions. Numer. Algorithms 2022, 91, 505–530. [Google Scholar] [CrossRef]
  12. Mishra, S.K.; Singh, V.; Laha, V. On duality for mathematical programs with vanishing constraints. Ann. Oper. Res. 2016, 243, 249–272. [Google Scholar] [CrossRef]
  13. Mishra, S.K.; Singh, V.; Laha, V.; Mohapatra, R.N. On constraint qualifications for multiobjective optimization problems with vanishing constraints. Optim. Methods Theory Appl. 2015, 95–135. [Google Scholar]
  14. Hoheisel, T. Mathematical Programs with Vanishing Constraints. Ph.D. Thesis, Universität Würzburg, Würzburg, Germany, 2009. [Google Scholar]
  15. Sadeghieh, A.; Kanzi, N.; Caristi, G.; Barilla, D. On stationarity for nonsmooth multiobjective problems with vanishing constraints. J. Glob. Optim. 2022, 82, 929–949. [Google Scholar] [CrossRef]
  16. Kazemi, S.; Kanzi, N. Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints. J. Optim. Theory Appl. 2018, 179, 800–819. [Google Scholar] [CrossRef]
  17. Laha, V.; Singh, V.; Pandey, Y.; Mishra, S.K. Nonsmooth mathematical programs with vanishing constraints in Banach spaces. In High-Dimensional Optimization and Probability: With a View Towards Data Science; Springer International Publishing: Cham, Switzerland, 2022; pp. 395–417. [Google Scholar]
  18. Wu, H.C. The Karush–Kuhn–Tucker optimality conditions in an optimization problem with interval-valued objective function. Eur. J. Oper. Res. 2007, 176, 46–59. [Google Scholar] [CrossRef]
  19. Wu, H.C. On interval-valued nonlinear programming problems. J. Math. Anal. Appl. 2008, 338, 299–316. [Google Scholar] [CrossRef]
  20. Laha, V.; Dwivedi, A. On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators. J. Anal. 2024, 32, 219–242. [Google Scholar] [CrossRef]
  21. Wu, H.C. Duality theory for optimization problems with interval-valued objective functions. J. Optim. Theory Appl. 2010, 144, 615–628. [Google Scholar] [CrossRef]
  22. Chalco-Cano, Y.; Lodwick, W.A.; Rufián-Lizana, A. Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative. Fuzzy Optim. Decis. Mak. 2013, 12, 305–322. [Google Scholar] [CrossRef]
  23. Wu, H.C. The Karush–Kuhn–Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions. Eur. J. Oper. Res. 2009, 196, 49–60. [Google Scholar] [CrossRef]
  24. Wu, H.C. The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions. Fuzzy Optim. Decis. Mak. 2009, 8, 1–28. [Google Scholar] [CrossRef]
  25. Osuna-Gómez, R.; Hernández-Jiménez, B.; Chalco-Cano, Y.; Ruiz-Garzón, G. New efficiency conditions for multiobjective interval-valued programming problems. Inf. Sci. 2017, 420, 235–248. [Google Scholar] [CrossRef]
  26. Ahmad, I.; Singh, D.; Dar, B.A. Optimality conditions in multiobjective programming problems with interval valued objective functions. Control Cybern. 2015, 44, 19–45. [Google Scholar]
  27. Singh, D.; Dar, B.A.; Kim, D.S. KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions. Eur. J. Oper. Res. 2016, 254, 29–39. [Google Scholar] [CrossRef]
  28. Rani, B.J.; Ahmad, I.; Kummari, K. On optimality and duality for multiobjective interval-valued programming problems with vanishing constraints. Iran. J. Numer. Anal. Optim. 2023, 13, 354–384. [Google Scholar]
  29. Yadav, T.; Gupta, S.K. Optimality and duality analysis for multiobjective interval-valued semi-infinite optimization problem having vanishing constraints. Comput. Appl. Math. 2024, 43, 56. [Google Scholar] [CrossRef]
  30. Van Su, T.; Dinh Dieu, H. Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints. Comput. Appl. Math. 2022, 41, 422. [Google Scholar] [CrossRef]
  31. Upadhyay, B.B.; Pandey, R.K.; Pan, J.; Zeng, S. Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence. J. Comput. Appl. Math. 2024, 438, 115550. [Google Scholar] [CrossRef]
  32. Ahmad, I.; Kummari, K.; Al-Homidan, S. Sufficiency and duality for interval-valued optimization problems with vanishing constraints using weak constraint qualifications. Int. J. Anal. Appl. 2020, 18, 784–798. [Google Scholar] [CrossRef]
  33. Joshi, B.C.; Mohan, R.; Minocha, A. On semi-infinite interval-valued optimization problems with vanishing constraints involving generalized convex functions. Math. Eng. Sci. Aerosp. (MESA) 2023, 14, 1–17. [Google Scholar]
  34. Joshi, B.C.; Roy, M.K.; Hamdi, A. On Semi-Infinite Optimization Problems with Vanishing Constraints Involving Interval-Valued Functions. Mathematics 2024, 12, 1008. [Google Scholar] [CrossRef]
  35. Clarke, F.H. Optimization and Nonsmooth Analysis; John Wiley & Sons: Hoboken, NJ, USA, 1983. [Google Scholar]
  36. Mishra, S.K.; Upadhyay, B.B.; An, L.T.H. Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems. J. Optim. Theory Appl. 2014, 160, 763–777. [Google Scholar] [CrossRef]
  37. Moore, R.E. Interval Analysis; Prentice-Hall: Englewood Cliffs, NJ, USA, 1966; Volume 4, pp. 8–13. [Google Scholar]
  38. Moore, R.E. Methods and Applications of Interval Analysis; SIAM: Philadelphia, PA, USA, 1979. [Google Scholar]
  39. Alefeld, G.; Herzberger, J. Introduction to Interval Computation; Academic Press: New York, NY, USA, 2012. [Google Scholar]
  40. Tung, L.T. Karush–Kuhn–Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions. J. Appl. Math. Comput. 2020, 62, 67–91. [Google Scholar] [CrossRef]
  41. Hung, N.H.; Tuan, H.N.; Tuyen, N.V. On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems. Appl. Anal. 2023, 102, 2432–2448. [Google Scholar] [CrossRef]
  42. Ioffe, A.D.; Tihomirov, V.M. Theory of Extremal Problems; North-Holland Publishing Company: Amsterdam, The Netherlands, 1979. [Google Scholar]
  43. Guillén, G.; Mele, F.D.; Bagajewicz, M.J.; Espuna, A.; Puigjaner, L. Multiobjective supply chain design under uncertainty. Chem. Eng. Sci. 2005, 60, 1535–1553. [Google Scholar] [CrossRef]
  44. Caplin, D.A.; Kornbluth, J.S.H. Multiobjective investment planning under uncertainty. Omega 1975, 3, 423–441. [Google Scholar] [CrossRef]
  45. Gupta, A.; Mehra, A.; Bhatia, D. Approximate convexity in vector optimisation. Bull. Aust. Math. Soc. 2006, 74, 207–218. [Google Scholar] [CrossRef]
  46. Bhatia, D.; Gupta, A.; Arora, P. Optimality via generalized approximate convexity and quasiefficiency. Optim. Lett. 2013, 7, 127–135. [Google Scholar] [CrossRef]
  47. Jaichander, R.R.; Ahmad, I.; Kummari, K.; Al-Homidan, S. Robust Nonsmooth Interval-Valued Optimization Problems Involving Uncertainty Constraints. Mathematics 2022, 10, 1787. [Google Scholar] [CrossRef]
  48. Gao, L.; Yu, G.; Han, W. Optimality conditions of the approximate efficiency for nonsmooth robust multiobjective fractional semi-Infinite optimization problems. Axioms 2023, 12, 635. [Google Scholar] [CrossRef]
  49. Wu, H.-C. Interval-Valued Multiobjective Programming Problems Based on Convex Cones. Symmetry 2024, 16, 1120. [Google Scholar] [CrossRef]
  50. Upadhyay, B.B.; Ghosh, A.; Treanţă, S.; Yao, J.C. Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds. Mathematics 2024, 12, 3047. [Google Scholar] [CrossRef]
Figure 1. The shaded region represents the points where the system (14) of Example 2 is solvable.
Figure 1. The shaded region represents the points where the system (14) of Example 2 is solvable.
Mathematics 13 03699 g001
Figure 2. The shaded region represents the points where the system (20) of Example 3 is solvable.
Figure 2. The shaded region represents the points where the system (20) of Example 3 is solvable.
Mathematics 13 03699 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

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