Abstract
The aim of this article is to study duality results for nonsmooth mathematical programs with equilibrium constraints in terms of tangential subdifferentials. We study the Wolfe-type dual problem under the convexity assumptions and a Mond–Weir-type dual problem is also formulated under convexity and generalized convexity assumptions for MPEC by using tangential subdifferentials. We establish weak duality and the two dual programs by assuming tangentially convex functions and also obtain strong duality theorems by assuming generalized standard Abadie constraint qualification.
Keywords:
mathematical programs with equilibrium constraints; wolfe type dual; mond–weir dual; tangential subdifferentials MSC:
90C29; 90C32; 90C46; 49K99
1. Introduction
Pshenichnyi [1] pioneered the idea of a specific category of functions known as tangentially convex. Later, Lemar’echal [2] conducted extensive research on this topic and is credited with popularizing the term “tangentially convex.” This class of functions encompasses various types, including Clark regular functions, Gateaux differentiable functions, and Michel–Penot regular subdifferentials [2,3]. An intriguing subset of nonlinear programming problems involves mathematical programming problems with equilibrium constraints (MPECs). These problems represent a unique and noteworthy area within the broader field of optimization. MPEC refers to a class of optimization problems in which part of the feasible set is determined implicitly by equilibrium conditions. These constraints can take the form of complementarity systems, variational inequalities, or other equilibrium formulations. Many authors gave several different approaches to solve this problem for the smooth case [4,5,6] and the nonsmooth case [7,8,9]. In 2015, Guo et al. [10] gave effective numerical methods for solving MPEC. MPEC arises frequently in various fields such as chemical process engineering, economic equilibrium, multilevel games, etc. [11]. MPEC problems pose significant challenges in terms of solution methods. Geometrically, the feasible region of such problems is typically non-convex and often lacks connectivity. Additionally, the constraints in MPEC typically violate the standard constraint qualifications—such as the Linear Independence Constraint Qualification (LICQ) and the Mangasarian–Fromovitz Constraint Qualification (MFCQ)—at all feasible points. To address these complexities, numerous researchers have proposed various stationarity concepts and constraint qualifications tailored to MPEC [12,13,14]. Recently, Mishra and Singh advanced the field by introducing several constraint qualifications and stationarity conditions utilizing the framework of tangential subdifferentials [15].
In nonlinear programming problems, the concept of duality is very important. Many authors studied dual problems corresponding to primal problems for solving different optimization problems in various fields (see [16,17,18]). For application of duality (see [19,20,21]), in 1961, Wolfe [22] introduced Wolfe duality, and in 1981, Mond and Weir [23] introduced Mond–Weir duality for different scalar functions. Later, many authors extended these duality results for nondifferentiable functions by using the tool of generalized convexity (see [24,25,26,27,28]). Tung [29] established KKT optimality conditions and duality for multiobjective semi-infinite programming by using tangential subdifferentials.
Notably, duality results for MPEC in the sense of tangential subdifferentials have not been studied yet. Motivated by the aforementioned contributions, we examine dual programs of the Wolfe-type and Mond–Weir-type for mathematical programming problems with equilibrium constraints (MPECs). In this context, we explore a range of duality theorems, employing the concept of tangential subdifferentials.
The organization of this paper is as follows: Section 2 provides some basic definitions and theorems that will be needed in the sequel of the paper. Section 3 presents Wolfe and Mond–Weir dual problems and establish weak and strong duality theorems for mathematical programs with equilibrium constraints and the two dual models using generalized convexity in the sense of tangential subdifferentials.
2. Preliminaries
In this section, we discuss some basic definitions and concepts that will be used in this sequel.
Let be a non-empty set. We denote by the convex hull of S and by cone S the convex cone generated by S. The notation represents the negative polar cone, defined as
The closure of a set S, written as , is the smallest closed set containing S. For a point , the contingent cone (or Bouligand tangent cone) to S at ℵ is given by
Our objective is to study the following mathematical programming problem with equilibrium constraints (MPEC):
where , , , and are tangentially convex functions and n = 1,2…N, p = 1,2…N, k = 1,2…N, l = 1,2…N where N is a finite number and n, p, k, l . The feasibility set of is denoted by X, that is,
Index sets for a feasible vector for the problem .
where is called the degenerate set.
Definition 1.
A function is called directionally differentiable at a point in the direction if the limit
exists and is finite. Furthermore, is said to be directionally differentiable (or semi-differentiable) at if the directional derivative exists and is finite for all directions .
Definition 2
([2,3,30]). A function is said to be tangentially convex at a point if the directional derivative exists and is finite for every direction . Moreover, the mapping
is required to be a convex function of d.
Definition 3
([1,3]). Let be tangentially convex at a point . The tangential subdifferential of Φ at , denoted by , is a non-empty, compact, and convex subset of such that the directional derivative satisfies
Equivalently, it can be represented as
Now, we prove is convex and compact.
Assuming is tangentially convex (so directional derivative is sublinear) and that lies in a region where the domain is nice (interior of domain), one can show the following:
- Convexity: Because is sublinear, the set of all linear functionals that lie below is a convex set. This is because the intersection of inequality-halfspaces of this form (one for each d) is convex.
- Closedness: The set is defined by an infinite family of linear inequalities Each such constraint defines a closed halfspace in . Intersection of closed halfspaces is closed.
- Boundedness (hence compactness in finite dimension): One typically needs a bound on growth of relative to d. Because is positively homogeneous, sublinear, there is often a Lipschitz bound or some estimate near d vectors that ensures the supporting function is finite, restricting how large can be. Once the set is closed and bounded, in finite dimensions it is compact.
The following concept of various stationary points was introduced by Mishra and Singh [15] in terms of tangential subdifferentials.
Definition 4
([15]). GW (Generalised Weakly)-stationary point A feasible point of problem is called a stationary point if there are vectors and such that
Definition 5
Definition 6
Definition 7
([15]). Let be an extended real-valued function and is tangentially convex function at . Then, is said to be
- (i)
- -convex at , if and only if , ;
- (ii)
- -pseudoconvex at , if and only if , ;
- (iii)
- -quasiconvex at if and only if , .
3. Duality
In this section, we formulate a dual problem of the Wolfe type for the primal problem , leveraging the concept of -convexity. Additionally, we analyze a Mond–Weir-type dual problem under the assumptions of -convexity and generalized -convexity for the primal problem .
The required index sets will be used:
- and
Theorem 1
(Weak Duality). Suppose the primal problem and its dual and we take and to be feasible for the primal and its dual, respectively.The index sets are defined accordingly. We consider , as tangentially convex functions and are functions at u. If , then for any ℵ feasible for the problem , we have
Proof.
Suppose ℵ be any feasible point for the problem . Then, we have
and
Since is convex at u, then,
Similarly, we have
From (4), there exists , , , , and , such that
Therefore,
From the feasibility of ℵ for the problem , , , , , we get
Hence,
where . □
Theorem 2
(Strong Duality). For the considered primal problem suppose and are local optimal solutions and locally Lipschitz near , respectively. Suppose that are tangentially convex functions and are -convex functions at . If [15] satisfied at , then ∃, such that is an optimal solution of the dual and the objective values of primal and dual are equal.
Proof.
For the problem , let be a locally optimal solution where the -ACQ holds at . Then, by (Cor. 5.1, [15]), there exist and such that the -stationary conditions (Def. 5.4, [15]) for the problem are satisfied. Specifically, there exist , , , , , and , such that
Therefore, is feasible for the dual . By Theorem 1, we have
where , from the feasibility condition of and any feasible solution for the dual , that is, for , , and , , , , , then, we have
where Using (11) and (12), we have
Hence, is an optimal solution for the dual and the respective objective values are equal. □
Example 1.
Suppose the following nonsmooth MPEC problem in with tangentially convex functions:
Clearly, all the functions are -convex at . Tangential subdifferentials at are , , , . Now, we easily prove that this problem satisfies all the conditions of Theorems 1 and 2.
For the considering primal problem , we formulate Mond–Weir-type dual and discuss duality theorems using tangential subdifferentials.
subject to
where
- and
Theorem 3
(Weak Duality). Let us consider the primal problem denoted as along with its associated dual problem . Assume that is feasible for the primal problem and is feasible for the dual problem. Define the index sets as appropriate to the context.
We examine the functions , for , for , for , and for which are characterized as tangentially convex as well as -convex at the point u.
If the union of the sets , , , and is empty, i.e.,
then for any feasible point ℵ pertaining to the problem , the following holds:
Proof.
Since is convex at u, then,
Similarly, we have
From duality results, there exists , , , , and , such that
Therefore,
Now, applying the feasibility of ℵ and u for the primal , and , respectively, we get
□
Corollary 1.
Consider the primal problem , and let be a feasible solution in which all the constraint functions , , , are affine, with the index sets , Θ, Ω, Y defined in the usual manner. Then, for any feasible solution ℵ of and any feasible pair of the corresponding dual problem , the strict inequality
cannot occur.
Example 2.
Consider the following problem in :
Here we see that the considered functions are tangentially convex. Let be the feasible point, then the tangential subdifferentials at (0, 0) are , ,
subject to: , such that
where
From (20), we have and . This leads us to the expressions and . Assuming , the index sets and are both empty, whereas is non-empty. Therefore, the conditions of Corollary 1 are satisfied. Next, if , then we find and . After resolving Equation (21), we obtain for all feasible ℵ. Similarly, when , the index sets and are empty, while is non-empty. In all cases examined, the conditions of Corollary 1 continue to hold. Thus, we confirm that Corollary 1 is satisfied between the primal problem and its dual .
Theorem 4
(Strong Duality). Suppose that is a local optimal solution of the primal problem , and let P be tangentially convex and locally Lipschitz continuous at this point. Further, assume that the functions : , , , , and are tangentially convex and -convex at . If the generalized standard Abadie constraint qualification (GS-ACQ) is satisfied at (see [15]), then there exists a multiplier vector such that the pair is an optimal solution of the dual problem , and moreover, the objective values of the primal and its dual coincide.
Proof.
The proof follows the same steps as the proof of Theorem 2 by using Theorem 3. □
We consider the primal problem and its , we establish weak and strong duality theorems under -convexity assumptions.
Theorem 5
(Weak Duality). Suppose that and are feasible for the primal problem and its , respectively, and the index sets are defined accordingly. Let be tangentially convex and -pseudoconvex at u, , , , are tangentially convex and are -quasiconvex functions at u. If , then for any ℵ feasible for the problem , we have
Proof.
Let a feasible point ℵ, such that then, by pseudoconvexity of at u, we have
From (13), there exists , , , , and , such that
By (22), we get
For each . Hence, by -quasiconvexity, we have
Similarly, we have
Now, for any feasible point u of the dual , and for each , also, , , and . By -quasiconvexity, we have
Since , we have
Therefore,
which contradicts (24). Hence, . □
Theorem 6
(Strong Duality). Suppose that is a local optimal solution of the problem , and let be tangentially convex and locally Lipschitz at that point. Additionally, assume that is -pseudoconvex at , and that , , , and are all tangentially convex and -quasiconvex functions at . If the generalized standard Abadie constraint qualification (GS-ACQ) is satisfied at , as discussed in [15], then there exists a multiplier vector such that the pair constitutes an optimal solution of the dual problem . Moreover, under this condition, the objective values of the primal and the dual coincide.
Proof.
The proof follows the same steps as the proof of Theorem 4 by using Theorem 5. □
4. Conclusions
In this work, we considered mathematical programs with equilibrium constraints (MPECs) under the assumption that both the objective and constraint functions are tangentially convex. We developed and analyzed the Wolfe-type and Mond–Weir-type dual formulations of the primal problem (P) by employing the framework of tangential subdifferentials. Furthermore, we established weak and strong duality theorems that link the primal problem (P) with its corresponding duals, under conditions of convexity and generalized convexity. In particular, the results were derived using the notions of -convexity, -pseudoconvexity and -quasiconvexity.
Author Contributions
In this research, V.S. and S.K.M. methodology; V.S. writing original draft; V.S. writing, review and editing; S.K.M. and A.H. supervision. All authors have read and agreed to the published version of the manuscript.
Funding
The second author is financially supported by “Research Grant for Faculty” (IoE Scheme) under Dev. Scheme No. 6031.
Data Availability Statement
Data sharing not applicable to this paper as no datasets were generated or analyzed during the current study.
Acknowledgments
The authors are indebted to the referees for their valuable comments and remarks that helped to improve the quality and presentation of the paper.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Pshenichnyi, B.N. Necessary Conditions for an Extremum; CRC Press: Boca Raton, FL, USA, 2020. [Google Scholar]
- Lemaréchal, C. An introduction to the theory of nonsmooth optimization. Optimization 1986, 17, 827–858. [Google Scholar] [CrossRef]
- Martínez-Legaz, J.E. Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints. Optim. Lett. 2015, 9, 1017–1023. [Google Scholar] [CrossRef]
- Luo, Z.Q.; Pang, J.S.; Ralph, D. Mathematical Programs with Equilibrium Constraints; Cambridge University Press: Cambridge, UK, 1996. [Google Scholar]
- Ye, J.J. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. 2015, 307, 350–369. [Google Scholar] [CrossRef]
- Flegel, M.L.; Kanzow, C. Abadie-type constraint qualification for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 2005, 124, 595–614. [Google Scholar] [CrossRef]
- Movahedian, N.; Nobakhtian, S. Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints. Nonlinear Anal. Theory Methods Appl. 2010, 72, 2694–2705. [Google Scholar] [CrossRef]
- Ye, J.J.; Zhang, J. Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 2014, 163, 777–794. [Google Scholar] [CrossRef]
- Pandey, Y.; Mishra, S.K. On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints. Oper. Res. Lett. 2016, 44, 148–151. [Google Scholar] [CrossRef]
- Guo, L.; Lin, G.H.; Ye, J.J. Solving mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 2015, 166, 234–256. [Google Scholar] [CrossRef]
- Raghunathan, A.U.; Biegler, L.T. Mathematical programs with equilibrium constraints (MPECs) in process engineering. Comput. Chem. Eng. 2003, 27, 1381–1392. [Google Scholar] [CrossRef]
- Guo, L.; Lin, G.H. Notes on some constraint qualifications for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 2013, 156, 600–616. [Google Scholar] [CrossRef]
- Chieu, N.H.; Lee, G.M. A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 2013, 158, 11–32. [Google Scholar] [CrossRef]
- Guo, L.; Lin, G.H.; Ye, J.J. Second-order optimality conditions for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 2013, 158, 33–64. [Google Scholar] [CrossRef]
- Mishra, S.K.; Singh, D. Mathematical programs, using tangential subdifferentials. arXiv 2025, arXiv:2509.03205. [Google Scholar] [CrossRef]
- Rockafellar, R.T. Duality and optimality in multistage stochastic programming. Ann. Oper. Res. 1999, 85, 1–19. [Google Scholar] [CrossRef]
- Ito, S.; Liu, Y.; Teo, K.L. A dual parametrization method for convex semi-infinite programming. Ann. Oper. Res. 2000, 98, 189–213. [Google Scholar] [CrossRef]
- Peterson, E.L. The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality. Ann. Oper. Res. 2001, 105, 109–153. [Google Scholar] [CrossRef]
- Thomson, J.J. XL. Cathode rays. Lond. Edinb. Dublin Philos. Mag. J. Sci. 1897, 44, 293–316. [Google Scholar] [CrossRef]
- Long, G.-L. General quantum interference principle and duality computer. Commun. Theor. Phys. 2006, 45, 825. [Google Scholar] [CrossRef]
- Zheng, C. Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm. Sci. Rep. 2021, 11, 3960. [Google Scholar] [CrossRef]
- Wolfe, P. A duality theorem for non-linear programming. Q. Appl. Math. 1961, 19, 239–244. [Google Scholar] [CrossRef]
- Mond, B.; Weir, T. Generalized Concavity and Duality, Generalized Concavity in Optimization and Economics; Academic Press: New York, NY, USA, 1981; pp. 263–279. [Google Scholar]
- Mishra, S.K.; Wang, S.Y.; Lai, K.K. V-Invex Functions and Vector Optimization; Springer: Berlin/Heidelberg, Germany, 2007; Volume 14. [Google Scholar]
- Mishra, S.K.; Wang, S.Y.; Lai, K.K. Generalized Convexity and Vector Optimization; Springer: Berlin/Heidelberg, Germany, 2009; Volume 90, p. 294. [Google Scholar]
- Bot, R.I.; Grad, S.M.; Wanka, G. Duality in Vector Optimization; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
- Mishra, S.K.; Singh, V. Wolfe type duality on quasidifferentiable mathematical programs with vanishing constraints. RAIRO-Oper. Res. 2024, 58, 3659–3673. [Google Scholar] [CrossRef]
- Joshi, B.C. Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0. RAIRO-Oper. Res. 2021, 55, S2221–S2240. [Google Scholar] [CrossRef]
- Tung, L.T. Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials. Numer. Funct. Anal. Optim. 2020, 41, 659–684. [Google Scholar] [CrossRef]
- Martínez-Legaz, J.E. A mean value theorem for tangentially convex functions. Set-Valued Var. Anal. 2023, 31, 13. [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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.