Next Article in Journal
Mathematical Model of the Evolution of a Simple Dynamic System with Dry Friction
Next Article in Special Issue
Recent Advances in Proximity Point Theory Applied to Fractional Differential Equations
Previous Article in Journal
Solitonical Inequality on Submanifolds in Trans-Sasakian Manifolds Coupled with a Slant Factor
Previous Article in Special Issue
Quasi-Contraction Maps in Subordinate Semimetric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Approximate Variational Inequalities and Bilevel Programming Problems

by
Balendu Bhooshan Upadhyay
1,†,
Ioan Stancu-Minasian
2,*,†,
Subham Poddar
1,† and
Priyanka Mishra
1,†
1
Department of Mathematics, Indian Institute of Technology Patna, Bihta 801106, India
2
“Gheorghe Mihoc-Caius Iacob” Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2024, 13(6), 371; https://doi.org/10.3390/axioms13060371
Submission received: 1 April 2024 / Revised: 17 May 2024 / Accepted: 27 May 2024 / Published: 30 May 2024
(This article belongs to the Special Issue Research on Fixed Point Theory and Application)

Abstract

:
In this paper, we investigate a class of bilevel programming problems (BLPP) in the framework of Euclidean space. We derive relationships among the solutions of approximate Minty-type variational inequalities (AMTVI), approximate Stampacchia-type variational inequalities (ASTVI), and local ϵ -quasi solutions of the BLPP, under generalized approximate convexity assumptions, via limiting subdifferentials. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (KKM)-Fan’s lemma, we derive some existence results for the solutions of AMTVI and ASTVI. We have furnished suitable, non-trivial, illustrative examples to demonstrate the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that explores relationships between the approximate variational inequalities and BLPP under the assumptions of generalized approximate convexity by employing the powerful tool of limiting subdifferentials.

1. Introduction

In optimization theory, bilevel optimization problems (BLPP) belong to a very interesting class of mathematical programming problems. Bilevel programming problems are hierarchical programming problems consisting of two decision makers (namely, the `leader’ and the `follower’), in which the two decision-makers target to obtain the best decision, with respect to different goals, in general. Moreover, these decision makers do not act independently, rather, they act according to a certain hierarchy, where based upon the choice of one decision maker (referred to as the ‘leader’), the second decision maker (referred to as the ‘follower’) has to react optimally.
The initial conceptualization and development of BLPP is attributed to the influential contributions of Von Stackelberg [1].The first mathematical bilevel model was developed by Bracken and McGill [2] in 1973. Various real-life practical problems arising in numerous areas of modern research, such as engineering, medicine, and economics, can be formulated in terms of BLPP. It is worthwhile to note that the investigation of BLPP has numerous benefits from both theoretical and practical standpoints (see, for instance, refs. [3,4,5] and the references cited therein). As a result, in the last few decades, numerous researchers have studied BLPP extensively and explored various interesting theories, such as optimistic and pessimistic methods to solve BLPP, single-level reformulation of BLPP, optimality criteria, duality results, and algorithms for BLPP to solve practical BLPP problems arising in various applications.
Necessary optimality criteria for BLPP were investigated by Bard [6]. Furthermore, Bard [7,8] discussed several interesting properties of BLPP and provided insights into its practical applications. Outrata [9] derived the necessary optimality conditions for a class of two-level Stackelberg problems in which the followers’ lower-level problems are convex programs with unique solutions. Dempe [10] derived necessary and sufficient optimality criteria for BLPP. Yezza [11] established the first-order necessary optimality criteria for a general BLPP. Moreover, Yezza [11] formulated the general multilevel programming problem and deduced the necessary conditions of optimality in the general case. Further, some rectifications of necessary optimality conditions for a general multilevel programming problem were discussed by Dempe [12]. Specifically, Dempe [12] has emphasized that upper semicontinuity should be used instead of lower semicontinuity to ensure the existence of optimal solutions. Furthermore, Dempe [12] has rectified the assumption that the abnormal part of the directional derivative of the optimal value function reduces to zero, replacing it with the requirement that a nonzero abnormal Lagrange multiplier does not exist. The optimistic version of BLPP and its necessary optimality conditions were studied by Dempe [13]. For further insights into BLPP, we refer to [7,14,15,16,17,18,19,20] and the references cited therein.
It has been observed by several researchers that the phenomenon of nonsmoothness arises frequently in various real-world problems (see, for instance, refs. [21,22] and the references cited therein). Rockafellar [22] introduced the notion of convex subdifferentials for nonsmooth convex functions. Subsequently, Clarke [21] introduced the notion of Clarke subdifferential for a class of local Lipschitz functions. However, the convexity of the Clarke subdifferential has led to various limitations. It has been observed that the generalized gradient may be too large for many important applications, particularly for necessary optimality conditions (see [23]). For instance, minimizing | x | over R and | x | | y | over R 2 demonstrates that the Clarke subdifferential includes points that are not minimizers of these functions (see [23]). Moreover, another significant drawback of the convex constructions of the Clarke subdifferentials concerns deficient conditions obtained in their terms for some fundamental properties in nonlinear analysis related to covering nonsmooth operators, metric regularity, open mapping theorems, and Lipschitzian stability (see, [23]). To overcome these shortcomings stemming from its convexity, Mordukhovich [23] proposed the concept of the limiting subdifferential. The Mordukhovich subdifferential is the smallest subdifferential among all nonconvex and robust subdifferential, and it has a better Lagrange multiplier rule than the Clarke subdifferential (see [23,24]). Moreover, for the class of local Lipschitz functions, the Mordukhovich subdifferential is contained in the Clarke subdifferential (see [23]). Therefore, the results established in terms of limiting subdifferentials naturally sharpen the results which are derived in terms of the Clarke subdifferentials. Mordukhovich subdifferential plays an important role in variational analysis, economics, equilibrium problems, and optimization (see [23,25,26] and the references cited therein).
In the realm of optimization theory, convexity assumes a pivotal role by ensuring that a stationary point acts as a global minimizer, and necessary optimality criteria are also sufficient for a point to be a global minimizer. In order to provide a much more accurate representation, modeling, and solutions to real-world problems, and numerous generalizations of convex functions have been introduced. Mangasarian [27] generalized the notion of convex function by introducing the class of pseudoconvex functions. For a detailed study of generalized convex functions, we refer to [28,29,30]. Ngai et al. [31] introduced the concept of approximate convex functions, which are stable under finite sums and suprema. Additionally, most well-known subdifferential concepts such as Clarke [21], Ioffe [32], and Mordukhovich [23] coincide for this class of functions. The main feature of this class of functions is that it includes the classes of convex functions, weakly convex functions, strongly convex functions of order q ( q 1 ) and strictly convex functions. Recently, several generalizations of approximate convex functions have been introduced, for instance, Bhatia et al. [33] and Gupta et al. [34].
The concept of variational inequality was introduced by Hartman and Stampacchia [35]. Variational inequalities appear in the forms of Minty variational inequality [36] and Stampacchia variational inequality [37]. Variational inequalities have several applications in the fields of economics, game theory, and traffic analysis (see [38,39] and the references cited therein). Variational inequality problems have been studied by several scholars as tools for solving optimization problems, for more exposition (see, [40,41,42,43,44,45,46,47,48,49,50,51,52] in the Euclidean space setting and [53,54,55] on Hadamard manifolds). Komlósi [56] derived the equivalence among the solutions of Minty and Stampacchia variational inequality and the optimal solution of the minimization problem. Kinderlehrer and Stampacchia [39] studied the relations between the solutions of variational inequality and minimization problems. Crespi et al. [57] investigated the relations between the solutions of Minty variational inequality and scalar optimization problems. Kohli [58] studied the relations between variational inequalities and BLPP involving generalized convex functions in terms of convexificators. However, the investigation of the relationships between the solutions of approximate variational inequalities and the local ϵ -quasi solutions of BLPP in the notion of limiting subdifferentials has not been explored yet. Consequently, this paper aims to address this specific research gap by establishing the relationships between the solutions of AMTVI, ASTVI, and the local ϵ -quasi solutions of BLPP by employing the powerful tool of limiting subdifferentials.
The primary motivation for studying the relationships between the solutions of BLPP and approximate variational inequalities is that the BLPP is generally a non-convex problem, making it challenging to find the optimal solution (see [15]). Jeroslow [59] initially highlighted that the BLPP is a non-deterministic polynomial hard problem (NP-hard problem). Furthermore, Vicente et al. [60] noted that finding a locally optimal solution to the BLPP also falls within the realm of NP-hard problems. To address this challenge, we delve into the concepts of AMTVI and ASTVI and investigate the relationships between the solutions of the BLPP and the considered approximate variational inequalities. By seeking solutions for AMTVI and ASTVI, one can typically identify local optimal solutions for the BLPP.
Motivated by the works of [33,57,58,61,62,63], in this paper we consider the BLPP and establish the relationships between the solutions of approximate variational inequalities, namely, AMTVI and ASTVI, and the local ϵ -quasi solutions of BLPP. Moreover, we deduce some existing results for the solutions of AMTVI and ASTVI, by employing the assumption of generalized KKM-Fan’s lemma.
The novelty and contributions of this paper are twofold. Firstly, the results of this paper extend the analogous results presented in [58] from smooth optimization problems to nonsmooth optimization problems and further generalize them from single-level optimization problems to bilevel optimization problems. Secondly, it is worthwhile to note that the limiting subdifferential is the smallest among all the known robust subdifferentials and offers a better Lagrange multiplier rule compared to the Clarke subdifferential (see [23,24]). Moreover, for a real-valued local Lipschitz function, the Mordukhovich limiting subdifferential is contained within its corresponding Clarke subdifferential (see [23]). Therefore, the established results of this paper sharpen the corresponding results derived by [33,61,63].
The organization of this article is as follows. In Section 2 we recall some basic definitions and preliminaries. In Section 3, employing the powerful tool of limiting subdifferential, we investigate the equivalence among the solutions of AMTVI and ASTVI, and the local ϵ -quasi solution of nonsmooth BLPP. In Section 4, a generalized KKM Fan’s lemma has been employed to establish the existence results for the solutions of approximate variational inequalities. In Section 5, we conclude our discussions and provide some future research directions.

2. Definition and Preliminaries

Throughout this paper, we use the notation · , · to denote the Euclidean inner product in the n-dimensional Euclidean space R n . The empty set is denoted by the symbol ∅. Let Ω be a nonempty set in R n × R m , equipped with the Euclidean norm · . The closure, interior, and the convex hull of Ω are denoted by the symbols cl Ω , int Ω , and co Ω , respectively. For any ( z ¯ 1 , z ¯ 2 ) Ω , we use the notation B ( ( z ¯ 1 , z ¯ 2 ) , d ) to denote an open ball centered at ( z ¯ 1 , z ¯ 2 ) , having radius d. Let y = ( y 1 , y 2 ) , and z = ( z 1 , z 2 ) Ω . The following definitions will be employed in the sequel:
( y , z ) = ( ( y 1 , y 2 ) , ( z 1 , z 2 ) ) : = { λ y + ( 1 λ ) z : λ ( 0 , 1 ) } , [ y , z ] = [ ( y 1 , y 2 ) , ( z 1 , z 2 ) ] : = { λ y + ( 1 λ ) z : λ [ 0 , 1 ] } .
We recall the following definition from [30].
Definition 1. 
The set Ω is said to be convex, provided for all z , z ¯ Ω , we have:
λ z + ( 1 λ ) z ¯ Ω , λ [ 0 , 1 ] .
Now, we recall the following definitions related to nonsmooth analysis from [23].
Definition 2. 
Let G : R n × R m R be a lower semi-continuous function. Then the Fréchet subdifferential of G at z ¯ 1 , z ¯ 2 R n × R m , denoted by ^ G z 1 , z 2 , is defined as follows:
^ G z 1 , z 2 : = v R n × R m : lim inf z 1 , z 2 z 1 , z 2 G z 1 , z 2 G z 1 , z 2 v , z 1 , z 2 z 1 , z 2 z 1 , z 2 z 1 , z 2 0 .
Definition 3. 
Let G : R n × R m R be a lower semi-continuous function. The limiting subdifferential of G : R n × R m R at z ¯ 1 , z ¯ 2 R n × R m , denoted by M G z ¯ 1 , z ¯ 2 , is defined as follows:
M G z ¯ 1 , z ¯ 2 = lim sup z 1 , z 2 z ¯ 1 , z ¯ 2 ^ G z 1 , z 2 ,
where lim sup is the Painlevé–Kuratowski outer limit.
Remark 1. 
Let z 1 , z 2 Ω and G : Ω R be a local Lipschitz function at ( z 1 , z 2 ) . Then, the the set valued map τ : Ω 2 Ω , defined by τ ( z 1 , z 2 ) : = M G z 1 , z 2 , is closed (see, for instance, [23]).
In the following definition, we recall the notions of generalized directional derivatives and Clarke subdifferential (see, [21]).
Definition 4. 
Let G : R n × R m R be a local Lipschitz function at the point z ¯ R n × R m . Then, the generalized directional derivative of G at z ¯ , in the direction ν R n , denoted by G ( z ¯ ; ν ) , is defined as follows:
G ( z ¯ ; ν ) = lim sup t 0 , z z ¯ G ( z + t ν ) G ( z ¯ ) t .
Definition 5. 
Let G : R n × R m R be a local Lipschitz function at the point z ¯ R n × R m . The Clarke subdifferential of G at the point z ¯ , denoted by C G ( z ¯ ) , is defined as follows:
C G ( z ¯ ) : = { y R n × R m : y , ν G ( z ¯ ; ν ) , ν R n × R m } .
Let G be a real-valued local Lipschitz function, defined on an open subset U of R n × R m . Then, the classical Rademacher theorem (see, [26]) states that the function G is differentiable almost everywhere on U, in the sense of Lebesgue measure. Therefore, the Clarke subdifferential of G at the point z ¯ R n × R m , can be represented as follows:
C G ( z ¯ ) = co { α R n × R m : z i z ¯ , G ( z i ) exists and G ( z i ) α } .
The following proposition from [23] provides the relationships between the limiting subdifferential and the Clarke subdifferential.
Proposition 1. 
If G : R n × R m R is a local Lipschitz function at ( z 1 , z 2 ) R n × R m , then
C G ( z 1 , z 2 ) = clco M G ( z 1 , z 2 ) .
In the following definition, we recall the notion of the lower-regularity condition of an extended real-valued function (see, [23]).
Definition 6. 
Let G : R n × R m R { ± } be finite at ( z ¯ 1 , z ¯ 2 ) R n × R m . Then G is said to be lower-regular at ( z ¯ 1 , z ¯ 2 ) , provided the following holds:
^ G ( z ¯ 1 , z ¯ 2 ) = M G ( z ¯ 1 , z ¯ 2 ) .
The following definitions of convex functions and generalized convex functions will be employed in the sequel (see, [28,64]).
Definition 7. 
Let D be a nonempty convex subset of R n × R m .
(i)
A function G : D R is said to be convex, provided the following inequality is satisfied for any z 1 , z 2 D and λ [ 0 , 1 ] :
G ( λ z 1 + ( 1 λ ) z 2 ) λ G ( z 1 ) + ( 1 λ ) G ( z 2 ) .
(ii)
A function G : D R is said to be strictly convex, provided the following inequality is satisfied for any z 1 , z 2 D with z 1 z 2 and λ ( 0 , 1 ) :
G ( λ z 1 + ( 1 λ ) z 2 ) < λ G ( z 1 ) + ( 1 λ ) G ( z 2 ) .
Remark 2. 
From Definition 7, it follows that strict convexity of the function G implies its convexity. However, the converse statement may not always be true. For instance, consider the function G : R n × R m R , defined as
G ( z ) : = z , α + β ,
where α R n × R m and β R . The function G is convex on R n × R m , but not strictly convex on R n × R m .
From now onwards, we assume that D is a non-empty open convex subset of R n × R m , unless otherwise specified.
Definition 8. 
A function G : D R is said to be quasiconvex, provided the following inequality is satisfied for all z 1 , z 2 D and λ [ 0 , 1 ] :
G ( λ z 1 + ( 1 λ ) z 2 ) max { G ( z 1 ) , G ( z 2 ) } .
Definition 9. 
A function G : D R is said to be pseudoconvex, provided for each z 1 , z 2 D , satisfying:
ξ , z 1 z 2 0 , for some ξ M G ( z 2 ) ,
we have:
G ( z 1 ) G ( z 2 ) .
The following propositions from Soleimani-damaneh [64] provide the characterizations of quasiconvex functions in terms of limiting subdifferentials.
Proposition 2. 
Let G : D R be a local Lipschitz and quasiconvex function. Then, for each z 1 , z 2 D , satisfying:
G ( z 1 ) G ( z 2 ) ,
we have:
ξ , z 1 z 2 0 , for some ξ M G ( z 2 ) .
Proposition 3. 
Let G : D R be a local Lipschitz function. Further, assume that for each z 1 , z 2 D and G ( z 1 ) G ( z 2 ) , we have ξ , z 1 z 2 0 , for all ξ M G ( z 2 ) . Then, G is a quasiconvex function.
Remark 3. 
(i) From Definitions 7–9, it follows that if G is a convex function, then it is both quasiconvex and pseudoconvex.
(ii) 
If G is a local Lipschitz pseudoconvex function on D , then G is quasiconvex (see, [64]).
(iii) 
The class of convex functions is stable under the finite sum. However, the class of quasiconvex and pseudoconvex functions are not stable under the finite sum (see, [28]).
Now, we consider the following bilevel programming problem (BLPP):
( BLPP ) min z 1 , z 2 Φ z 1 , z 2 , subject to H j z 1 , z 2 0 , j J : = 1 , , m 2 , z 2 L z 1 , min z 2 θ z 1 , z 2 , subject to h i z 1 , z 2 0 , i I : = 1 , , m 1 ,
where Φ : R n × R m R , θ : R n × R m R , H j : R n × R m R , j J , and h i : R n × R m R , i I are real valued functions, and
L z 1 : = argmin z 2 θ z 1 , z 2 : h i z 1 , z 2 0 , i I .
Therefore, the basic idea is that based on the choice of the leader, the follower minimizes his objective function θ , and the leader then uses the obtained solution z 2 = z 2 z 1 to minimize his objective function Φ . BLPP is said to be well-defined if we can uniquely determine the optimal solution of the lower-level problem for every z 1 R n . In literature, two types of solution concepts have been studied for BLPPs having more than one optimal solution for the corresponding lower-level problems, namely, the optimistic solution and the pessimistic solution.
In the optimistic approach, the follower considers an optimal solution, which is the best from the leader’s perspective. As a result, one has the following optimistic bilevel programming problem (OBLPP):
( OBLPP ) min z 1 Ψ z 1 , subject to z 1 R n ,
where Ψ z 1 = min z 2 Φ z 1 , z 2 : H j z 1 , z 2 0 , j J , z 2 L z 1 ,
and L z 1 is the set of all optimal solutions for the following lower-level problem:
min z 2 θ z 1 , z 2 , subject to h i z 1 , z 2 0 , i I .
Let S be the set of all feasible solutions to the problem BLPP, that is,
S : = { ( z 1 , z 2 ) R n × R m : H j ( z 1 , z 2 ) 0 , j J , h i ( z 1 , z 2 ) 0 , i I , z 2 L ( z 1 ) } .
Now, we define:
Ω : = { ( z 1 , z 2 ) R n × R m : H j ( z 1 , z 2 ) 0 , j J , h i ( z 1 , z 2 ) 0 , i I } .
Moreover, for any fixed z 1 R n , we define the function F z 1 : R m R , as follows:
F z 1 ( z 2 ) : = θ ( z 1 , z 2 ) , ( z 1 , z 2 ) Ω .
Therefore, it is evident that
S = { ( z 1 , z 2 ) Ω : z 2 = argmin z 2 F z 1 ( z 2 ) } .
In the rest of the paper, we assume that Ω is a non-empty convex subset of R n × R m , unless specified otherwise.
Remark 4. 
The relationships between BLPP and variational inequalities have been investigated by Kohli [58] via convexificators. It is worthwhile to note that the lower-level problem has been assumed to be continuous and convex by Kohli [58]. However, we emphasize that such convexity and continuity assumptions are not imposed by us on the lower-level problem. This observation highlights the broader scope of the findings presented in this paper compared to those established in [58].
In the following definition, we recall the notion of approximate convex functions, which is closed under finite sum and suprema (see, Ngai and Penot [65]).
Definition 10. 
A function G : Ω R is termed as an approximate convex function around z ¯ 1 , z ¯ 2 Ω , provided for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, satisfying:
G μ z 1 2 , z 2 2 + ( 1 μ ) z 1 1 , z 2 1 μ G z 1 2 , z 2 2 + ( 1 μ ) G z 1 1 , z 2 1 + ϵ μ ( 1 μ ) z 1 2 , z 2 2 z 1 1 , z 2 1 ,
for all z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω and μ [ 0 , 1 ] .
We have the following characterization for lower semicontinuous approximate convex functions from Ngai and Penot [65].
Proposition 4. 
A lower semicontinuous function G : Ω R is termed as an approximate convex function around z ¯ 1 , z ¯ 2 Ω , if and only if for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, satisfying:
G z 1 2 , z 2 2 G z 1 1 , z 2 1 ξ , z 1 2 , z 2 2 z 1 1 , z 2 1 ϵ z 1 2 , z 2 2 z 1 1 , z 2 1 ,
for any z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω and any ξ M G z 1 1 , z 2 1 .
Following the work of Bhatia et al. [33] and Golestani et al. [66], in the following definitions, we introduce the notions of approximate convex function and M -pseudoconvex functions of type I and I I in terms of limiting subdifferentials.
Definition 11. 
A function G : Ω R is termed as an approximate M -pseudoconvex function of type I around z ¯ 1 , z ¯ 2 Ω , if for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, satisfying:
G z 1 1 , z 2 1 G z 1 2 , z 2 2 ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 ,
for all z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω , such that
ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 0 , for some ξ M G z 1 2 , z 2 2 .
Definition 12. 
A function G : Ω R is termed as an approximate M -pseudoconvex function of type II around z ¯ 1 , z ¯ 2 Ω , if for any ϵ > 0 , ( ϵ R ) some d > 0 ( d R ) exists, satisfying:
G z 1 1 , z 2 1 G z 1 2 , z 2 2 ,
for all z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω , such that
ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 + ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 0 , for some ξ M G z 1 2 , z 2 2 .
Remark 5. 
It is evident from Definitions 11 and 12 that if G : Ω R is an approximate M -pseudoconvex of type II around z ¯ 1 , z ¯ 2 Ω , then G is also an approximate M -pseudoconvex of type I around z ¯ 1 , z ¯ 2 . However, the converse statement may not always be true. For example, let G : [ 1 , 1 ] R be defined as:
G ( z ) : = z , z 0 , z 2 + 1 , z > 0 .
Then, the limiting subdifferentiable of G is given by:
M G ( z ) = 1 , z < 0 , [ 1 , ) , z = 0 , 2 z , z > 0 .
It can be verified that G is the approximate M -pseudoconvex function of type I around z ¯ = 0 , but not the approximate M -pseudoconvex function of type II around z ¯ = 0 . Moreover, it is worthwhile to note that the function G is not local Lipschitz at the point z ¯ = 0 . Hence, the Clarke subdifferential of G does not exist at z ¯ = 0 .
Remark 6. 
If G : Ω R is pseudoconvex at ( z ¯ 1 , z ¯ 2 ) Ω , then G is also an approximate M -pseudoconvex function of type I around ( z ¯ 1 , z ¯ 2 ) . However, the converse statement may not always be true. For example, let G : [ 2 π , 2 π ] R be defined as:
G ( z ) : = z 2 + 1 , z < 0 , sin z + e z , z 0 .
The Clarke and limiting subdifferentials of G are given by:
C G ( z ) = M G ( z ) = 2 z , z < 0 , [ 0 , 2 ] , z = 0 , cos z + e z , z > 0 .
Let z R and z > π , we observe that
ξ , z z ¯ 0 , ξ M G ( z ¯ ) does not imply G ( z ) G ( z ¯ ) .
Hence, it can be verified that G is an approximate M -pseudoconvex function of type I around z ¯ , but not a pseudoconvex function at z ¯ .
Following the work of Bhatia et al. [33] and Golestani et al. [66], in the following definitions, we introduce the notions of M -quasiconvex functions of type I and I I in terms of limiting subdifferentials.
Definition 13. 
A function G : Ω R is termed as an approximate M -quasiconvex of type I around z ¯ 1 , z ¯ 2 Ω , if, for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, satisfying:
ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 0 , ξ M G z 1 2 , z 2 2 ,
for all z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω , such that
G z 1 1 , z 2 1 G z 1 2 , z 2 2 .
Definition 14. 
A function G : Ω R is termed as an approximate M -quasiconvex of type II around z ¯ 1 , z ¯ 2 Ω , if for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, satisfying:
ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 0 , ξ M G z 1 2 , z 2 2 ,
for all z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω , such that
G z 1 1 , z 2 1 G z 1 2 , z 2 2 + ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 .
Remark 7. 
From the above definitions, it follows that, if G : Ω R is the approximate M -quasiconvex function of type II around ( z ¯ 1 , z ¯ 2 ) Ω , then G is the approximate M -quasiconvex function of type I around ( z ¯ 1 , z ¯ 2 ) . However, the converse statement may not always be true. For example, let G : [ π , π ] R be given as:
G ( z ) = z 2 , z < 0 , sin z , z 0 .
Then the Clarke and limiting subdifferentials of G are given by:
C G ( z ) = M G ( z ) = 2 z , z < 0 , [ 0 , 1 ] , z = 0 , cos z , z > 0 .
Therefore, one can conclude that G is the approximate M -quasiconvex function of type I around z ¯ = 0 , but not the approximate M -quasiconvex function of type II around z ¯ = 0 .
Definition 15. 
A function G : Ω R is termed as an approximate M -quasiconvex function around z ¯ 1 , z ¯ 2 Ω , provided for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, such that the following implication holds:
G z 1 1 , z 2 1 G z 1 2 , z 2 2 ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 + ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 0 ,
for any z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω and for all ξ M G z 1 2 , z 2 2 .
Definition 16. 
A function G : Ω R is termed as an approximate M -pseudoconvex function around z ¯ 1 , z ¯ 2 Ω , provided for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) exists, such that the following implication holds:
G z 1 1 , z 2 1 < G z 1 2 , z 2 2 ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 + ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 < 0 ,
for any z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω and for all ξ M G z 1 2 , z 2 2 .
Remark 8. 
It is worthwhile to mention that the limiting subdifferential of a local Lipschitz function at a point is contained in the corresponding Clarke subdifferential at that point. Therefore, if G : Ω R is local Lipschitz and generalized approximate convex function around ( z ¯ 1 , z ¯ 2 ) Ω in terms of Clarke subdifferential (see, Bhatia et al. [33]), then G is also generalized M -approximate convex function around z ¯ Ω . However, the converse statement may not always be true. To justify this fact, we consider the lower semicontinuous function G : [ 1 , 1 ] R , defined as:
G ( z ) : = z , z 0 , z 2 + 1 , z > 0 .
Then the limiting subdifferentiable of G is given by:
M G ( z ) = 1 , z < 0 , [ 1 , ) , z = 0 , 2 z , z > 0 .
Evidently, G is an approximate M -pseudoconvex of type I around z ¯ = 0 , but not an approximate pseudoconvex of type I around z ¯ = 0 in terms of Clarke subdifferential. However, we can easily observe that G is not local Lipschitz at z ¯ = 0 . Consequently, the Clarke subdifferential does not exist at z ¯ = 0 .
Definition 17. 
A multi-valued mapping G : Ω 2 Ω is termed as an approximate ϵ-pseudomonotone around z ¯ 1 , z ¯ 2 , if there exists d > 0 , such that for each z 1 1 , z 2 1 , z 1 2 , z 2 2 B z ¯ 1 , z ¯ 2 , d Ω , if
ζ , z 1 1 , z 2 1 z 1 2 , z 2 2 + ϵ z 1 1 , z 2 1 z 1 2 , z 2 2 0 ,
then
ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 0 ,
whenever ξ G z 1 1 , z 2 1 , ζ G z 1 2 , z 2 2 .
The following mean value theorem for local Lipschitz functions from [23], will be employed in the sequel.
Theorem 1. 
Let G : Ω R { ± } be a local Lipschitz function on an open set containing z 1 2 , z 2 2 , z 1 1 , z 2 1 in Ω. Moreover, suppose that G is lower regular on z 1 2 , z 2 2 , z 1 1 , z 2 1 . Then, we have
G z 1 1 , z 2 1 G z 1 2 , z 2 2 = ξ , z 1 1 , z 2 1 z 1 2 , z 2 2 ,
for some ξ M G u 1 , u 2 and u 1 , u 2 z 1 2 , z 2 2 , z 1 1 , z 2 1 ) .
The following notions of ϵ -quasi solution and local ϵ -quasi solution for BLPP are adaptations of the notions of ϵ -quasi solution and local ϵ -quasi solution for scalar optimization problems from Loridan [67].
Definition 18. 
Let ϵ > 0 be given. A point z ¯ 1 , z ¯ 2 Ω is termed as an ϵ-quasi solution to the BLPP if, for any z 1 , z 2 Ω , the following inequalities hold:
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 .
Definition 19. 
Let ϵ > 0 be given. A point z ¯ 1 , z ¯ 2 Ω is termed as a local ϵ-quasi solution to BLPP if there exists d > 0 , such that the following inequalities hold:
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 ,
for any z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω .
The following example illustrates the fact that the limiting subdifferential of a real-valued function may be strictly contained within its Clarke subdifferential.
Example 1. 
Consider the real-valued function G : R R , defined as follows:
G ( z ) = z | z | .
Then, the limiting subdifferential of G is given as:
M G ( z ) = 0 , z > 0 , { 0 , 2 } , z = 0 , 2 , z < 0 ,
and the Clarke subdifferential of G is given by:
C G ( z ) = 0 , z > 0 , , z = 0 , 2 , z < 0 .
In view of Proposition 1, one can observe that the limiting subdifferential for a real-valued local Lipschitz function is contained within its Clarke subdifferential. Furthermore, this example demonstrates that the limiting subdifferential of a real-valued local Lipschitz function G , as defined above may be strictly contained within its Clarke subdifferential. Since the results of this paper are derived in terms of limiting subdifferentials, therefore, our findings naturally sharpen the analogous results of [33,61,63].
Now, we consider the following AMTVI and ASTVI in terms of limiting subdifferentials:
  • AMTVI: Find z ¯ 1 , z ¯ 2 Ω , such that for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) , such that for each z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω and all ξ 1 M Φ z 1 , z 2 and ξ 2 M F z 1 ( z 2 ) , the following inequalities hold:
    ξ 1 , z 1 , z 2 z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , ξ 2 , z 2 z ¯ 2 ϵ z 2 z ¯ 2 .
  • ASTVI: Find z ¯ 1 , z ¯ 2 Ω , such that for any ϵ > 0 ( ϵ R ) , some d > 0 ( d R ) , such that for each z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , there exists ζ 1 M Φ z ¯ 1 , z ¯ 2 and ζ 2 M F z 1 ( z ¯ 2 ) such that the following inequalities hold:
    ζ 1 , z 1 , z 2 z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , ζ 2 , z 2 z ¯ 2 ϵ z 2 z ¯ 2 .

3. Relationship among BLPP, ASTVI, and AMTVI

This section is devoted to the study of the equivalence relationships between the solutions of approximate variational inequalities, namely, AMTVI, ASTVI, and the local ϵ -quasi solutions of the BLPP by employing the powerful tool of limiting subdifferentials. In the remaining portion of this section, we suppose that ϵ > 0 is a preassigned positive real number and Φ is a lower semicontinuous function unless otherwise specified.
Theorem 2. 
Let Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) be approximate convex functions around z ¯ 1 , z ¯ 2 Ω . If z ¯ 1 , z ¯ 2 is local ϵ-quasi solution of BLPP, then z ¯ 1 , z ¯ 2 solves AMTVI with respect to 2 ϵ .
Proof. 
Let z ¯ 1 , z ¯ 2 is a local ϵ -quasi solution of BLPP which does not solve AMTVI with respect to 2 ϵ . Then for all d > 0 , we can obtain z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω and ξ 1 M Φ z 1 , z 2 and ξ 2 M F z 2 ( z 1 ) , such that one of the following holds:
ξ 1 , z 1 , z 2 z ¯ 1 , z ¯ 2 + 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 < 0 .
ξ 2 , z 2 z ¯ 2 + 2 ϵ z 2 z ¯ 2 < 0
Since Φ and F z 1 are approximate M -convex around z ¯ 1 , z ¯ 2 , therefore, for each ϵ > 0 , some d > 0 , such that, for every z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω and ξ 1 M Φ z 1 , z 2 and ξ 2 M F z 2 ( z 1 ) , we have:
Φ z ¯ 1 , z ¯ 2 Φ z 1 , z 2 ξ 1 , z ¯ 1 , z ¯ 2 z 1 , z 2 ϵ z ¯ 1 , z ¯ 2 z 1 , z 2 , F z 1 ( z ¯ 2 ) F z 2 ( z 2 ) ξ 2 , z ¯ 2 z 2 ϵ z 2 z ¯ 2 .
From (3), it follows that
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 ξ 1 z 1 , z 2 z ¯ 1 , z ¯ 2 + 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 ,
F z 2 ( z 2 ) F z 2 ( z ¯ 2 ) + ϵ z 2 z ¯ 2 ξ 2 , z 2 z ¯ 2 + 2 ϵ z 2 z ¯ 2 .
From (1), (2), (4), and (5), it follows that for each z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , one of the following inequalities holds true:
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 < 0 , or F z 2 ( z 2 ) F z 2 ( z ¯ 2 ) + ϵ z 2 z ¯ 2 < 0 .
This contradicts the fact that ( z ¯ 1 , z ¯ 2 ) is a local ϵ -quasi solution of BLPP. This completes the proof. □
Theorem 3. 
Let Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) be local Lipschitz lower-regular functions at z ¯ 1 , z ¯ 2 . Moreover, assume that z ¯ 1 , z ¯ 2 solves AMTVI with respect to ϵ < ϵ and Φ, F z 1 are approximate convex functions around z ¯ 1 , z ¯ 2 Ω . Then, z ¯ 1 , z ¯ 2 is a local ϵ-quasi solution of BLPP.
Proof. 
On contrary, let us suppose that z ¯ 1 , z ¯ 2 Ω solves AMTVI with respect to ϵ < ϵ , but z ¯ 1 , z ¯ 2 is not a local ϵ -quasi solution of BLPP. Hence, for all d > 0 , z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , such that one of the following holds:
Φ z 1 , z 2 < Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 .
F z 1 ( z 2 ) < F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 .
Let z 1 ( μ ) , z 2 ( μ ) = z ¯ 1 , z ¯ 2 + μ z 1 , z 2 z ¯ 1 , z ¯ 2 , for all μ [ 0 , 1 ] . Since, Φ and F z 1 are approximate convex functions around z ¯ 1 , z ¯ 2 , hence, for each ϵ > 0 , d > 0 , such that for all z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , we have
Φ z ¯ 1 , z ¯ 2 + μ z 1 , z 2 z ¯ 1 , z ¯ 2 μ Φ z 1 , z 2 + ( 1 μ ) Φ z ¯ 1 , z ¯ 2 + ϵ μ ( 1 μ ) z 1 , z 2 z ¯ 1 , z ¯ 2 , μ [ 0 , 1 ] .
F z 1 ( z ¯ 2 + μ ( z 2 z ¯ 2 ) ) μ F z 1 ( z 2 ) + ( 1 μ ) F z 1 ( z ¯ 2 ) + ϵ μ ( 1 μ ) z 2 z ¯ 2 , μ [ 0 , 1 ] .
Let μ ( 0 , 1 ) be arbitrary. Now in view of Theorem 1, there exist μ 1 , μ 2 ( 0 , μ ) and ξ 1 M Φ z ¯ 1 , z ¯ 2 + μ 1 z 1 , z 2 z ¯ 1 , z ¯ 2 and ξ 2 M F z 1 ( z ¯ 2 + μ 2 ( z 2 z ¯ 2 ) ) , such that
μ ξ 1 , z 1 , z 2 z ¯ 1 , z ¯ 2 = Φ z ¯ 1 , z ¯ 2 + μ z 1 , z 2 z ¯ 1 , z ¯ 2 Φ z ¯ 1 , z ¯ 2 .
μ ξ 2 , z 2 z ¯ 2 = F z 1 ( z ¯ 2 + μ ( z 2 z ¯ 2 ) ) F z 1 ( z ¯ 2 ) .
Combining (8)–(11), we have
ξ 1 , z 1 , z 2 z ¯ 1 , z ¯ 2 Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 + ϵ ( 1 μ ) z 1 , z 2 z ¯ 1 , z ¯ 2 ,
ξ 2 , z 2 z ¯ 2 F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) + ϵ μ ( 1 μ ) z 2 z ¯ 2 .
From (6), (7), (12), and (13), it follows that one of the following inequalities holds true:
ξ 1 , z 1 , z 2 z ¯ 1 , z ¯ 2 < ϵ μ z 1 , z 2 z ¯ 1 , z ¯ 2 .
ξ 2 , z 2 z ¯ 2 < ϵ μ z 2 z ¯ 2 .
Since μ 1 , μ 2 > 0 , it follows that one of the following inequalities holds true:
ξ 1 , z 1 μ 1 , z 2 μ 1 z ¯ 1 , z ¯ 2 + ϵ z 1 μ 1 , z 2 μ 1 z ¯ 1 , z ¯ 2 < 0 ,
ξ 2 , z 2 ( μ 2 ) z ¯ 2 < ϵ z 2 ( μ 2 ) z ¯ 2 ,
where ϵ = ϵ μ . This contradicts the fact that ( z ¯ 1 , z ¯ 2 ) solves AMTVI. This completes the proof. □
Theorem 4. 
Suppose that z ¯ 1 , z ¯ 2 Ω is a local ϵ-quasi solution of BLPP. Further, we assume that Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) are approximate M -quasiconvex functions of type II around z ¯ 1 , z ¯ 2 ). Then z ¯ 1 , z ¯ 2 solves AMTVI with respect to ϵ.
Proof. 
Since z ¯ 1 , z ¯ 2 Ω is a local ϵ -quasi solution of BLPP, therefore, d > 0 , such that for all z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , we have
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , and F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 .
Moreover, as Φ and F z 1 ( z 2 ) are approximate M -quasiconvex functions of type II around ( z ¯ 1 , z ¯ 2 ) . Hence, for any ϵ > 0 , d > 0 , such that for each z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , with
Φ z ¯ 1 , z ¯ 2 Φ z 1 , z 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 ,
one has
ξ , z ¯ 1 , z ¯ 2 z 1 , z 2 0 , ξ M Φ z 1 , z 2 ,
and
F z 1 ( z ¯ 2 ) F z 1 ( z 2 ) + ϵ z 2 z ¯ 2 η , z ¯ 2 z 2 0 , η M F z 1 ( z 2 ) .
Let d ¯ : = min d , d . Then from (18) and in view of the M -quasiconvexity of type II of Φ and F z 1 around ( z ¯ 1 , z ¯ 2 ) , it follows that
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 0 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 ,
and
η , z 2 z ¯ 2 0 ϵ z 2 z ¯ 2 ,
are satisfied for every z 1 , z 2 B z ¯ 1 , z ¯ 2 , d ¯ Ω . Therefore,
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , ξ M Φ z 1 , z 2 ,
and
η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 , η M F z 1 ( z 2 ) .
This completes the proof. □
Theorem 5. 
Let z ¯ 1 , z ¯ 2 be a solution of ASTVI with respect to ϵ. Further, suppose that Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) are approximate M -pseudoconvex functions around z ¯ 1 , z ¯ 2 . Then z ¯ 1 , z ¯ 2 is a local ϵ-quasi solution of BLPP.
Proof. 
On contrary, suppose that z ¯ 1 , z ¯ 2 solves ASTVI with respect to ϵ , but not a local ϵ -quasi solution of BLPP. Hence, for each d > 0 , some z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω exists, such that one of the following inequalities holds true:
Φ z 1 , z 2 < Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 .
F z 1 ( z 2 ) < F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 .
Further, Φ and F z 1 are approximate M -pseudoconvex functions around z ¯ 1 , z ¯ 2 . Hence, from (19) and (20), it follows that for every ϵ > 0 , there exists some d > 0 , such that for any z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , one of the following inequalities holds true:
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 < 0 , ξ M Φ z ¯ 1 , z ¯ 2 η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 < 0 , η M F z 1 ( z ¯ 2 ) .
Evidently, this is a contradiction. This completes the proof. □
Theorem 6. 
Let z ¯ 1 , z ¯ 2 be a solution of ASTVI with respect to ϵ. Further, suppose that Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) are approximate M -pseudoconvex functions of type II around z ¯ 1 , z ¯ 2 . Then z ¯ 1 , z ¯ 2 is a local ϵ-quasi solution of BLPP.
Proof. 
Let z ¯ 1 , z ¯ 2 solves ASTVI with respect to ϵ . Then we can obtain a d > 0 , such that for each z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , there exist ξ M Φ z ¯ 1 , z ¯ 2 and η M F z 1 ( z ¯ 2 ) , such that
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , and η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 .
Since Φ and F z 1 are approximate M -pseudoconvex functions of type II around z ¯ 1 , z ¯ 2 , then for every ϵ > 0 , d > 0 , and for any z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , with
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , for some ξ M Φ z ¯ 1 , z ¯ 2 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 , for some η M F z 1 ( z ¯ 2 ) ,
we have
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 , F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) .
Let d ¯ : = min d , d . Then from (21) and the M -pseudoconvexity of type II of Φ and F z 1 around ( z ¯ 1 , z ¯ 2 ) , it follows that
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 ,
and
F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 ,
for every z 1 , z 2 B z ¯ 1 , z ¯ 2 , d ¯ Ω . Hence, z ¯ 1 , z ¯ 2 is a local ϵ -quasi solution of BLPP. This completes the proof. □
Theorem 7. 
Let Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) be local Lipschitz functions at z ¯ 1 , z ¯ 2 . Moreover, assume that z ¯ 1 , z ¯ 2 is a local ϵ-quasi solution of BLPP, and Φ and F z 1 are approximate M -quasiconvex functions of type II around ( z ¯ 1 , z ¯ 2 . Then z ¯ 1 , z ¯ 2 is a solution of ASTVI with respect to ϵ.
Proof. 
Let z ¯ 1 , z ¯ 2 Ω be a local ϵ -quasi solution of BLPP. Then, some d > 0 exists, such that for each z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , we have
Φ z 1 , z 2 Φ z ¯ 1 , z ¯ 2 ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , F z 1 ( z 2 ) F z 1 ( z ¯ 2 ) ϵ z 2 z ¯ 2 .
Further, Φ and F z 1 are approximate M -quasiconvex functions of type II around z ¯ 1 , z ¯ 2 . Therefore, for all ϵ > 0 , we can obtain a d > 0 such that for all z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , if
Φ z ¯ 1 , z ¯ 2 Φ z 1 , z 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 , F z 1 ( z ¯ 2 ) F z 1 ( z 2 ) + ϵ z 2 z ¯ 2 ,
then
ξ , z ¯ 1 , z ¯ 2 z 1 , z 2 0 , ξ M Φ z 1 , z 2 , η , z ¯ 2 z 2 0 , η M F z 1 ( z 2 ) .
Let d ¯ : = min d , d and z ¯ 1 ( μ ) , z ¯ 2 ( μ ) = z ¯ 1 , z ¯ 2 + μ z 1 , z 2 z ¯ 1 , z ¯ 2 , μ ( 0 , 1 ) , such that μ < d ¯ . Then from (22), it follows that
Φ z ¯ 1 ( μ ) , z ¯ 2 ( μ ) Φ z ¯ 1 , z ¯ 2 ϵ z ¯ 1 ( μ ) , z ¯ 2 ( μ ) z ¯ 1 , z ¯ 2 , F z 1 ( z ¯ 2 ( μ ) ) F z 1 ( z ¯ 2 ) ϵ z ¯ 2 ( μ ) z ¯ 2 .
Employing (23) and the approximate M -quasiconvexity of type II of the functions Φ and F z 1 around ( z ¯ 1 , z ¯ 2 ) , one has
ξ μ , z ¯ 1 , z ¯ 2 z ¯ 1 ( μ ) , z ¯ 2 ( μ ) 0 , ξ μ M Φ z ¯ 1 ( μ ) , z ¯ 2 ( μ ) , η μ , z ¯ 2 z ¯ 2 ( μ ) 0 , η μ M F z 1 ( z ¯ 2 ( μ ) ) .
Hence, we arrive at the following:
ξ μ , z 1 , z 2 z ¯ 1 , z ¯ 2 0 , ξ μ M Φ z ¯ 1 ( μ ) , z ¯ 2 ( μ ) , η μ , z 2 z ¯ 2 0 , η μ M F z 1 ( z ¯ 2 ( μ ) ) .
From (24), we have
ξ μ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , ξ μ M Φ z ¯ 1 ( μ ) , z ¯ 2 ( μ ) , η μ , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 , η μ M F z 1 ( z ¯ 2 ( μ ) ) .
Since, M Φ and M F z 1 are closed, ξ μ M Φ z ¯ 1 ( μ ) , z ¯ 2 ( μ ) , η μ M F z 1 ( z ¯ 2 ( μ ) ) , ξ μ ξ , η μ η , and z ¯ 1 ( μ ) , z ¯ 2 ( μ ) z ¯ 1 , z ¯ 2 as μ 0 , we have ξ M Φ z ¯ 1 , z ¯ 2 and η M F z 1 ( z ¯ 2 ) . Therefore, for any z 1 , z 2 B z ¯ 1 , z ¯ 2 , d S , there exist ξ M Φ z ¯ 1 , z ¯ 2 and η M F z 1 ( z ¯ 2 ) , such that
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 .
This completes the proof. □
Remark 9. 
Theorem 3 extends Theorem 2.2 of [56] from smooth optimization problems to nonsmooth optimization problems and, moreover, generalizes them from single-level optimization problems to a more general class of optimization problems, namely, bilevel optimization problems.
Theorem 8. 
Let z ¯ 1 , z ¯ 2 be a solution of ASTVI with respect to ϵ. Further, suppose that M Φ and M F z 1 are approximate ϵ-pseudomonotone. Then z ¯ 1 , z ¯ 2 solves AMTVI with respect to ϵ.
Proof. 
Let z ¯ 1 , z ¯ 2 be a solution of ASTVI with respect to ϵ . Then, some d > 0 exists, such that for all z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω , there exists ξ M Φ z ¯ 1 , z ¯ 2 and η M F z 1 ( z ¯ 2 ) , such that
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 .
Combining (27) with the approximate ϵ -pseudomonotonicity hypotheses on M Φ , M F z 1 , it follows that there exists 0 < d d , such that for all z 1 , z 2 B z ¯ 1 , z ¯ 2 , d Ω and all ξ M Φ z 1 , z 2 , η M F z 1 ( z 2 ) , we have
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 0 , η , z 2 z ¯ 2 0 .
Since ϵ > 0 , it follows that
ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 .
Hence, z ¯ 1 , z ¯ 2 is a solution of AMTVI with respect to ϵ . This completes the proof. □
The following example illustrates the importance of the established results.
Example 2. 
We consider the following bilevel programming problem:
( BLPP ) min z 1 , z 2 Φ z 1 , z 2 = z 1 + z 2 , subject to H z 1 , z 2 = z 1 z 2 0 , z 2 L z 1 ,
where L z 1 is the set of optimal solutions of the following optimization problem:
min z 2 θ z 1 , z 2 = | z 2 | subject to h 1 z 1 , z 2 = z 1 2 z 2 0 , h 2 z 1 , z 2 = z 2 2 z 2 , z 2 0 , z 2 , z 2 < 0 ,
where Φ , θ : R × R R , H : R × R R and h 1 , h 2 : R × R R . The set L z 1 of optimal solutions for lower-level problem is given by:
L z 1 = { 0 } , z 1 R ,
and F z 1 ( z 2 ) = | z 2 | . Moreover, we have
Φ z 1 , 0 = z 1 .
Let S denote the set of all feasible solutions of BLPP, that is, S = z 1 , 0 : z 1 R . Then, for ϵ = 1 5 , it can be verified that ( 0 , 0 ) is a local ϵ-quasi solution of the problem. Moreover, we have:
M Φ ( 0 , 0 ) = ξ 1 , ξ 2 : ξ 1 ξ 2 1 ξ 1 , ξ 2 : ξ 1 [ 1 , 1 ] , ξ 1 = ξ 2 1 , M F z 1 ( 0 ) = [ 1 , 1 ] .
Further, it can be verified that Φ and F z 1 are approximate M -pseudoconvex and approximate M -quasiconvex around ( 0 , 0 ) .
It is worthwhile to note that, Φ and F z 1 are convex functions. Therefore, the limiting subdifferentials of Φ and F z 1 coincide with the corresponding Clarke subdifferentials of Φ and F z 1 .
Furthermore, we can verify that ( 0 , 0 ) is a solution of A M T V I with respect to ϵ, as for all z 1 , z 2 B ( 0 , 0 ) , 1 2 S , we have
ξ 1 , z 1 , z 2 ( 0 , 0 ) + ϵ z 1 , z 2 ( 0 , 0 ) 0 , ξ 2 , z 2 0 + ϵ z 2 0 0 .
Moreover, ( 0 , 0 ) is also a solution of ASTVI with respect to the same ϵ, as for all z 1 , z 2 B ( 0 , 0 ) , 1 2 Ω , there exists ζ 1 M Φ ( 0 , 0 ) and ζ 2 M F z 1 ( 0 ) , such that
ζ 1 , z 1 , z 2 ( 0 , 0 ) + ϵ z 1 , z 2 ( 0 , 0 ) 0 , ζ 2 , z 2 0 + ϵ z 2 0 0 .

4. Existence Results

In this section, we employ the generalized KKM-Fan’s lemma to derive certain conditions for the existence of the solution of AMTVI and ASTVI.
The following definition of KKM map is from Rezaie and Zafarani [68].
Definition 20. 
A set-valued map B : R n 2 R n is termed a KKM map if for any subset z 1 , z 2 , , z p of R n , we have:
co z 1 , z 2 , , z p i = 1 p B z i .
The following KKM-Fan’s lemma is from [68].
Lemma 1. 
Let B , M : K R n 2 R n be two set valued mappings, such that the following assertions are satisfied:
1.
M ( y ) B ( y ) , for all y K ,
2.
M is a KKM-map,
3.
B ( y ) is closed for all y K and is bounded for at least one y K .
Then y K B ( y ) .
Theorem 9. 
Let Ω be a nonempty, compact subset of R n × R m . Moreover, assume that Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) are local Lipschitz functions. Then ASTVI has a solution in Ω.
Proof. 
To begin with, for each z 1 , z 2 Ω , we define the set-valued mappings B , M : Ω 2 Ω by
B ( z 1 , z 2 ) = M z 1 , z 2 : = { z ¯ 1 , z ¯ 2 Ω : ξ , z 1 , z 2 z ¯ 1 , z ¯ 2 + ϵ ( z 1 , z 2 ) z ¯ 1 , z ¯ 2 0 , for some ξ M Φ z ¯ 1 , z ¯ 2 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 , for some η M F z 1 ( z ¯ 2 ) } .
Clearly, B and M are nonempty. Now, we claim that M is a KKM map. If not, there exists a finite set z 1 1 , z 2 1 , , z 1 p , z 2 p Ω and μ k 0 , k = 1 , , p with k = 1 p μ k = 1 , such that
z 1 , z 2 = k = 1 p μ k z 1 k , z 2 k k = 1 p M z 1 k , z 2 k .
From (29), it follows that z 1 , z 2 M z 1 k , z 2 k for all k = 1 , , p . That is
ξ , z 1 k , z 2 k z 1 , z 2 + ϵ z 1 k , z 2 k z 1 , z 2 < 0 , ξ M Φ z 1 , z 2 , η , ( z 2 k z 2 ) + ϵ z 2 k z 2 < 0 , η M F z 1 ( z 2 ) .
Multiplying (30) by μ k and summing from k = 1 to p, we obtain
0 > k = 1 p ξ , μ k z 1 k , z 2 k μ k z 1 , z 2 + ϵ k = 1 p μ k z 1 k , z 2 k z 1 , z 2 ξ , k = 1 p μ k z 1 k , z 2 k z 1 , z 2 + ϵ k = 1 p μ k z 1 k , z 2 k z 1 , z 2 = 0 ,
and
0 > k = 1 p η , μ k z 2 k μ k z 2 + ϵ k = 1 p μ k z 2 k z 2 η , k = 1 p μ k z 2 k z 2 + ϵ k = 1 p μ k z 2 k z 2 = 0 ,
which is a contradiction. Hence, B = M is a KKM map.
Now, our aim is to show that the set-valued map B is closed for all z 1 , z 2 Ω . Let z 1 n , z 2 n be a sequence in B, such that z 1 n , z 2 n z 1 , z 2 Ω . We have to show that z 1 , z 2 B . Since z 1 n , z 2 n B , therefore, there exist ξ n M Φ z 1 n , z 2 n and η n M F z 1 ( z 2 n ) , such that
ξ n , z 1 , z 2 z 1 n , z 2 n + ϵ z 1 , z 2 z 1 n , z 2 n 0 , η n , ( z 2 ) ( z 2 n ) + ϵ z 2 z 2 n 0 .
Since M Φ and M F z 1 are closed, ξ n M Φ z 1 n , z 2 n , η n M F z 1 ( z 2 n ) , ξ n ξ , η n η and z 1 n , z 2 n z 1 , z 2 . We have ξ M Φ z 1 , z 2 and η M F z 1 ( z 2 ) ,
ξ , z 1 , z 2 z 1 , z 2 + ϵ z 1 , z 2 z 1 , z 2 0 , η , z 2 z 2 + ϵ z 2 z 2 0 .
Hence, B is closed. Since Ω is bounded, therefore, B is bounded for each z 1 , z 2 Ω . As a result, in view of Lemma 1, we have
z 1 , z 2 Ω B z 1 , z 2 ,
which implies that for some z 1 , z 2 Ω , ∃ z ¯ 1 , z ¯ 2 , such that for all ξ M Φ z ¯ 1 , z ¯ 2 , η M F z 1 ( z ¯ 2 ) , we have:
ξ , z 1 , z 2 z ¯ 1 z ¯ 2 + ϵ z 1 , z 2 z ¯ 1 , z ¯ 2 0 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 .
Hence, ASTVI has a solution in Ω . This completes the proof. □
Theorem 10. 
Let Ω be a nonempty compact set. Further, suppose that Φ : R n × R m R and F z 1 : R m R ( z 1 R n ) are local Lipschitz functions. Then AMTVI has a solution in Ω.
Proof. 
Let set-valued mapping B = M : Ω 2 Ω be defined as:
B ( z 1 , z 2 ) : = { ( z ¯ 1 , z ¯ 2 ) Ω : ξ M Φ ( z 1 , z 2 ) , η M F z 1 ( z 2 ) , such that ξ , ( z 1 , z 2 ) ( z ¯ 1 , z ¯ 2 ) + ϵ ( z 1 , z 2 ) ( z ¯ 1 , z ¯ 2 ) 0 , η , z 2 z ¯ 2 + ϵ z 2 z ¯ 2 0 , ( z 1 , z 2 ) Ω } .
Now, proceeding along similar lines as the proof of Theorem 9, we obtain the required result. □

5. Conclusions and Future Directions

In this paper, we have investigated BLPP, AMTVI, and ASTVI in the framework of Euclidean spaces via limiting subdifferentials. In particular, we have derived the relationships among the solutions of AMTVI, ASTVI, and the local ϵ -quasi solution to the nonsmooth BLPP under suitable generalized approximate convexity hypotheses. Furthermore, existing results for the solution of AMTVI and ASTVI have been established by employing generalized KKM-Fan’s lemma. A non-trivial example has been furnished to illustrate the importance of the deduced results.
The results derived in this paper extend several interesting results available in the literature for a wider class of optimization problems. In particular, the results of this paper extend the corresponding results presented in [56] from smooth optimization problems to nonsmooth optimization problems and further generalize it from single-level optimization problems into bilevel optimization problems. In [58], the author has assumed that the lower-level problem of the BLPP is both continuous and convex. However, it is essential to emphasize that we did not impose any convexity and continuity assumptions on the lower-level problem. This observation highlights the broader scope of the findings presented in this paper compared to those in [58]. Moreover, the author in [58] has employed optimal value reformulation to convert the BLPP into single-level optimization problems. However, our work is distinctive in the sense that it directly establishes the connection between the two concepts without relying on any intermediate methods. Furthermore, to establish our results, we have employed the powerful tool of Mordukhovich limiting subdifferential, which is the smallest among all the known robust subdifferential, and it has a better Lagrange multiplier rule than the Clarke subdifferential (see, [23,24]). In addition, for a local Lipschitz real-valued function, the Mordukhovich limiting subdifferential may be strictly contained within its corresponding Clarke subdifferential (see, Example 1). Therefore, our findings naturally sharpen the analogous results of [33,61,63]
Considering the contributions of Deb and Sinha [14] and Oveisiha and Zafarani [69], we aim to extend the results established in this paper to multiobjective bilevel programming problems and to a broader space, such as the Asplund space, in our future research endeavors.

Author Contributions

Conceptualization, B.B.U. and I.S.-M.; Methodology, B.B.U.; Software, S.P. and P.M.; Validation, B.B.U. and P.M.; Formal analysis, I.S.-M. and S.P.; Investigation, B.B.U.; Resources, B.B.U.; Writing—original draft, S.P.; Writing—review & editing, P.M. All authors have read and agreed to the published version of the manuscript.

Funding

The third author extends gratitude to the Ministry of Education, Government of India, for their financial support through the Prime Minister Research Fellowship (PMRF), granted under PMRF ID-2703573.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

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.

Acknowledgments

The authors would like to thank the anonymous referees for their careful reading of the paper and constructive suggestions, which have substantially improved the paper in its present form.

Conflicts of Interest

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

References

  1. Stackelberg, H. The Theory of the Market Economy; Oxford University Press: Oxford, UK, 1952. [Google Scholar]
  2. Bracken, J.; McGill, J.T. Mathematical programs with optimization problems in the constraints. Oper. Res. 1973, 21, 37–44. [Google Scholar] [CrossRef]
  3. Ben-Ayed, O.; Boyce, D.E.; Blair, C.E. A general bilevel linear programming formulation of the network design problem. Transp. Res. 1988, 21, 37–44. [Google Scholar] [CrossRef]
  4. Ben-Ayed, O.; Blair, C.E. Computational difficulties of bilevel linear programming. Oper. Res. 1990, 38, 556–560. [Google Scholar] [CrossRef]
  5. Hansen, P.; Jaumard, B.; Savard, G. New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 1992, 13, 1194–1217. [Google Scholar] [CrossRef]
  6. Bard, J.F. Optimality conditions for the bilevel programming problem. Naval Res. Logistics Quart. 1984, 31, 13–26. [Google Scholar] [CrossRef]
  7. Bard, J.F. Some properties of the bilevel problem. J. Optim. Theory Appl. 1991, 68, 371–378. [Google Scholar] [CrossRef]
  8. Bard, J.F. Practical Bilevel Optimization, Algorithms and Applications; Kluwer Academic: Dordrecht, The Netherlands, 1998. [Google Scholar]
  9. Outrata, J.V. Necessary optimality conditions for stackelberg problems. J. Optim. Theory Appl. 1993, 76, 305–320. [Google Scholar] [CrossRef]
  10. Dempe, S. A necessary and sufficient optimality condition for bilevel programming problem. Optimization 1992, 25, 341–354. [Google Scholar] [CrossRef]
  11. Yezza, A. First-order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 1996, 89, 189–219. [Google Scholar] [CrossRef]
  12. Dempe, S. First-order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 1997, 95, 735–739. [Google Scholar] [CrossRef]
  13. Dempe, S.; Dutta, J.; Mordhukovich, B.S. New necessary optimality conditions in optimistic bilevel programming. Optimization 2007, 56, 577–604. [Google Scholar] [CrossRef]
  14. Deb, K.; Sinha, A. Solving bilevel multi-objective optimization problems using evolutionary algorithms. In Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization, Nantes, France, 7–10 April 2009; Springer: Berlin/Heidelberg, Germany, 2009; pp. 110–124. [Google Scholar]
  15. Dempe, S. Foundations of Bilevel Programming; Kluwer Academic: Boston, MA, USA, 2002. [Google Scholar]
  16. Dempe, S.; Gadhi, N.; Ohda, M. On interval-valued bilevel optimization problems using upper convexificators. RAIRO Oper. Res. 2023, 57, 1009–1025, Erratum in RAIRO Oper. Res. 2023, 57, 2519–2519. [Google Scholar] [CrossRef]
  17. Dempe, S.; Gadhi, N.; El Idrissi, M. Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem. Optimization 2020, 69, 1811–1830. [Google Scholar] [CrossRef]
  18. Dempe, S.; Gadhi, N.; Lafhim, L. Optimality conditions for pessimistic bilevel problems using convexificator. Positivity 2020, 24, 1399–1417. [Google Scholar] [CrossRef]
  19. Sinha, A.; Malo, P.; Deb, K. A review on bilevel optimization: From classical to evolutionary approaches and applications. IEEE Trans. Evol. Comput. 2017, 22, 276–295. [Google Scholar] [CrossRef]
  20. Zemkohoo, A.; Dempe, S. Bilevel Optimization Advances and Next Challenges; Springer: Geneva, Switzerland, 2020. [Google Scholar]
  21. Clarke, F.H. Optimization and Nonsmooth Analysis; John Wiley and Sons: New York, NY, USA, 1983. [Google Scholar]
  22. Rockafellar, R.T. Convex Analysis; Princeton University Press: Princeton, NJ, USA, 1970. [Google Scholar]
  23. Mordukhovich, B.S. Variational Analysis and Generalized Differentiation I, Basic Theory; Springer: New York, NY, USA, 2006. [Google Scholar]
  24. Mishra, S.K.; Jaiswal, M.; Thi, H.A.L. Nonsmooth semi-infinite programming problem using limiting subdifferentials. J. Glob. Optim. 2012, 53, 285–296. [Google Scholar] [CrossRef]
  25. Mordukhovich, B.S. Variational Analysis and Generalized Differentiation, II Applications; Springer: Berlin, Germany, 2006. [Google Scholar]
  26. Rockafellar, R.T.; Wets, R.J.-B. Variational Analysis; Springer: Berlin, Germany, 1998. [Google Scholar]
  27. Mangasarian, O.L. Nonlinear Programming; McGraw-Hill: New York, NY, USA, 1969. [Google Scholar]
  28. Cambini, A.; Martein, L. Generalized Convexity and Optimization; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  29. Mishra, S.K.; Upadhyay, B.B. Efficiency and duality in nonsmooth multiobjective fractional programming involving η-pseudolinear functions. Yugosl. J. Oper. Res. 2012, 22, 3–18. [Google Scholar] [CrossRef]
  30. 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]
  31. Ngai, H.V.; Luc, D.T.; Théra, M. Approximate convex functions. J. Nonlinear Convex Anal. 2000, 1, 155–176. [Google Scholar]
  32. Ioffe, A.D. On the theory of subdifferentials. Adv. Nonlinear Anal. 2012, 1, 47–120. [Google Scholar] [CrossRef]
  33. Bhatia, D.; Gupta, A.; Arora, P. Optimality via generalized approximate convexity and quasiefficiency. Optim. Lett. 2013, 7, 127–135. [Google Scholar] [CrossRef]
  34. Gupta, A.; Mehra, A.; Bhatia, D. Approximate convexity in vector optimisation. Bull. Aust. Math. Soc. 2006, 74, 207–218. [Google Scholar] [CrossRef]
  35. Hartman, P.; Stampacchia, G. On some non-linear elliptic differential-functional equations. Acta Math. 1966, 115, 271–310. [Google Scholar] [CrossRef]
  36. Minty, G.J. On the generalization of a direct method of the calculus of variations. Bull. Amer. Math. Soc. 1967, 73, 315–321. [Google Scholar] [CrossRef]
  37. Stampacchia, G. Formes bilinearies coercitives sur les ensembles convexes. C. R. Acad. Sci. 1964, 258, 4413–4416. [Google Scholar]
  38. Dafermos, S. Exchange price equilibria and variational inequalities. Math. Program. 1990, 46, 391–402. [Google Scholar] [CrossRef]
  39. Kinderlehrer, D.; Stampacchia, G. An Introduction to Variational Inequalities and Their Applications; Academic Press: London, UK, 1980. [Google Scholar]
  40. Giannessi, F. On Minty variational principle. In New Trends in Mathematical Programming; Giannessi, F., Komlósi, S., Rapcśak, T., Eds.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1997; pp. 93–99. [Google Scholar]
  41. Lee, G.M.; Kim, D.S.; Lee, B.S.; Yen, N.D. Vector variational inequality as a tool for studying vector optimization problems. Nonlinear Anal. 1998, 34, 745–765. [Google Scholar] [CrossRef]
  42. Lee, G.M.; Lee, K.B. Vector variational inequalities for nondifferential convex vector optimization problems. J. Glob. Optim. 2005, 32, 597–612. [Google Scholar] [CrossRef]
  43. Ansari, Q.H.; Köbis, E.; Yao, J.C. Vector Variational Inequalities and Vector Optimization; Springer: Berlin, Germany, 2018. [Google Scholar]
  44. Bhardwaj, R.K.; Ram, T. Relationship between nonsmooth vector optimization problem and vector variational inequalities using convexificators. Int. J. Nonlinear Anal. Appl. 2024, 15, 1–10. [Google Scholar]
  45. Bhardwaj, R.K.; Ram, T. On interval-valued vector variational-like inequalities and vector optimization problems with generalized approximate invexity via convexificators. Math. Found. Comput. 2023. [CrossRef]
  46. Ruiz-Garzón, G.; Osuna-Gxoxmez, R.; Rufián-Lizana, A.; Hernxaxndez-Jiménez, B. Optimality in continuous-time multiobjective optimization and vector variational-like inequalities. Top 2015, 23, 198–219. [Google Scholar] [CrossRef]
  47. Singh, H.N.; Laha, V. On minty variational principle for quasidifferentiable vector optimization problems. Optim. Methods Softw. 2023, 38, 243–261. [Google Scholar] [CrossRef]
  48. Upadhyay, B.B.; Stancu-Minasian, I.M.; Mishra, P. On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities. Optimization 2022, 72, 2635–2659. [Google Scholar] [CrossRef]
  49. Upadhyay, B.B.; Mishra, P. On vector variational inequalities and vector optimization problems. In Soft Computing: Theories and Applications; Springer: Singapore, 2020; pp. 257–267. [Google Scholar]
  50. Upadhyay, B.B.; Mishra, P. On generalized Minty and Stampacchia vector variational-like inequalities and nonsmooth vector optimization problem involving higher order strong invexity. J. Sci. Res. 2020, 64, 282–291. [Google Scholar] [CrossRef]
  51. Upadhyay, B.B.; Mishra, P. On generalized vector variational-like inequalities and nonsmooth multiobjective programming problems using limiting subdifferential. In Proceedings of the Mathematical Analysis and Computing: ICMAC 2019, Kalavakkam, India, 23–24 December 2019; Springer: Singapore, 2019. [Google Scholar]
  52. Upadhyay, B.B.; Mishra, P.; Mohapatra, R.N.; Mishra, S.K. On the applications of nonsmooth vector optimization problems to solve generalized vector variational inequalities using convexificators. In Advances in Intelligent Systems and Computing; Springer: Cham, Switzerland, 2020. [Google Scholar]
  53. Upadhyay, B.B.; Treanta, S.; Mishra, P. On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds. Optimization 2022, 72, 3081–3100. [Google Scholar] [CrossRef]
  54. Treanta, S.; Mishra, P.; Upadhyay, B.B. Minty variational principle for nonsmooth interval-valued vector optimization problems on Hadamard manifolds. Mathematics 2022, 10, 523. [Google Scholar] [CrossRef]
  55. Upadhyay, B.B.; Stancu-Minasian, I.M.; Mishra, P.; Treanta, S. On Generalized Vector Variational Inequalities and Nonsmooth Vector Optimization Problems on Hadamard Manifolds involving Geodesic Approximate Convexity. Adv. Nonlinear Var. Inequal. 2022, 25, 1–25. [Google Scholar]
  56. Komlósi, S. On the Stampacchia and Minty variational inequalities. In Generalized Convexity and Optimization for Economic and Financial Decisions; Giorgi, G., Rossi, F., Eds.; Pitagora Editrice: Bologna, Italy, 1999. [Google Scholar]
  57. Crespi, G.P.; Guerraggio, A.; Rocca, M. Minty variational inequality and optimization: Scalar and vector case. In Generalized Convexity, Generalized Monotonicity and Applications; Springer: Boston, MA, USA, 2005; pp. 193–211. [Google Scholar]
  58. Kohli, B. Variational inequalities and optimistic bilevel programming problem via convexificators. In Topics in Nonconvex Optimization; Springer: New York, NY, USA, 2011; pp. 243–255. [Google Scholar]
  59. Jeroslow, R.G. The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 1985, 32, 146–164. [Google Scholar] [CrossRef]
  60. Vicente, L.; Savard, G.; Judice, J. Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 1994, 81, 379–399. [Google Scholar] [CrossRef]
  61. Mishra, S.K.; Upadhyay, B.B. Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency. Positivity 2013, 17, 1071–1083. [Google Scholar] [CrossRef]
  62. Mishra, S.K.; Upadhyay, B.B. Pseudolinear Functions and Optimization, 1st ed.; CRC Press, Taylor & Francis Group: New York, NY, USA, 2015. [Google Scholar]
  63. Upadhyay, B.B.; Mohapatra, R.N.; Mishra, S.K. On relationships between vector variational inequality and nonsmooth vector optimization problems via strict minimizers. Adv. Nonlinear Var. Inequal. 2017, 20, 1–12. [Google Scholar]
  64. Soleimani-damaneh, M. Characterization of nonsmooth quasiconvex and pseudoconvex functions. J. Math. Anal. Appl. 2007, 330, 1387–1392. [Google Scholar] [CrossRef]
  65. Ngai, H.V.; Penot, J.P. Approximately convex functions and approximately monotonic operators. Nonlinear Anal. 2007, 66, 547–564. [Google Scholar] [CrossRef]
  66. Golestani, M.; Sadeghi, H.; Tavan, Y. Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency. J. Optim. Theory Appl. 2018, 179, 896–916. [Google Scholar] [CrossRef]
  67. Loridan, P. ϵ-solutions in vector minimization problems. J. Optim. Theory Appl. 1984, 43, 265–276. [Google Scholar] [CrossRef]
  68. Rezaie, M.; Zafarani, J. Vector optimization and variational-like inequalities. J. Glob. Optim. 2009, 43, 47–66. [Google Scholar] [CrossRef]
  69. Oveisiha, M.; Zafarani, J. Generalized Minty vector variational-like inequalities and vector optimization problems in Asplund spaces. Optim. Lett. 2013, 7, 709–721. [Google Scholar] [CrossRef]
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

Upadhyay, B.B.; Stancu-Minasian, I.; Poddar, S.; Mishra, P. On Approximate Variational Inequalities and Bilevel Programming Problems. Axioms 2024, 13, 371. https://doi.org/10.3390/axioms13060371

AMA Style

Upadhyay BB, Stancu-Minasian I, Poddar S, Mishra P. On Approximate Variational Inequalities and Bilevel Programming Problems. Axioms. 2024; 13(6):371. https://doi.org/10.3390/axioms13060371

Chicago/Turabian Style

Upadhyay, Balendu Bhooshan, Ioan Stancu-Minasian, Subham Poddar, and Priyanka Mishra. 2024. "On Approximate Variational Inequalities and Bilevel Programming Problems" Axioms 13, no. 6: 371. https://doi.org/10.3390/axioms13060371

APA Style

Upadhyay, B. B., Stancu-Minasian, I., Poddar, S., & Mishra, P. (2024). On Approximate Variational Inequalities and Bilevel Programming Problems. Axioms, 13(6), 371. https://doi.org/10.3390/axioms13060371

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