Abstract
Recently, Mishra et al. (Ann Oper Res 243(1):249–272, 2016) formulate and study the Wolfe and the Mond–Weir type dual models for the mathematical programs with vanishing constraints. They establish the weak, strong, converse, restricted converse and strict converse duality results between the primal mathematical programs with vanishing constraints and the corresponding dual model under some assumptions. However, their models contain the calculation of the index sets, this makes it difficult to solve them from algorithm point of view. In this paper, we propose the new Wolfe and Mond–Weir type dual models for the mathematical programs with vanishing constraints, which do not involve the calculation of the index set. We show that the weak, strong, converse and restricted converse duality results hold between the primal mathematical programs with vanishing constraints and the corresponding new dual models under the same assumptions as the ones of Mishra et al.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Mathematical program with vanishing constraints (MPVC) was introduced by Achtziger and Kanzow (2008), and its general form is as follows:
where \(f : R^n\rightarrow R\) is Lipschitz continuous, \(g : R^n \rightarrow R^m, h : R^n \rightarrow R^p, , \ G, H : R^n\rightarrow R^l\) are all continuously differentiable functions. Throughout this paper, X denotes the feasible region of MPVC (1.1).
MPVC problem originates from the optimization topology design problems in mechanical structures (Achtziger and Kanzow 2008). At present, the corresponding research shows that the robot motion planning problem (Kirches et al. 2013) can be transformed into the MPVC problem. In addition, it is also widely used in the economic dispatch problem (Jabr 2012) and the nonlinear integer optimal control (Michael et al. 2013). As described in Achtziger and Kanzow (2008), the major difficulty in solving problem (1.1) is that it does not satisfy most of the standard constraint qualifications such as linearly independent constraint qualification (LICQ) and Mangasarian–Fromovitz constraint qualification (MFCQ) at any interesting feasible point, so that the standard optimization methods are likely to fail for this problem. The MPVC has attracted much attentions in recent years. Several theoretical properties and different numerical approaches for MPVC can be found in Achtziger and Kanzow (2008), Kirches et al. (2013), Hoheisel et al. (2010), Hu et al. (2014), Hu et al. (2017), Benko and Gfrerer (2017), Achtziger et al. (2013), Achtziger et al. (2012), Dorsch et al. (2012), Hoheisel and Kanzow (2009), Hoheisel and Kanzow (2008), Hoheisel and Kanzow (2007), Hoheisel et al. (2012), Izmailov and Pogosyan (2009) and Izmailov and Solodov (2009).
Duality is very important in optimization as the weak duality provides a lower bound to the objective function value of the primal problem. The classical Wolfe duality was introduced by Wolfe (1961), while the Mond–Weir duality was introduced by Mond and Weir (1981) for differentiable scalar functions. Later these duality models were extended to nondifferentiable functions by utilizing different generalizations of the notion of convexity for both scalar and vector cases (See Mishra et al. 2016; Antczak 2010; Chinchuluun et al. 2007; Askar and Tiwari 2009; Gulati and Mehndiratta 2010; Bot and Heinrich 2014; Lai and Huang 2012; Jefferson and Scott 2001; Lee and Lai 2005; Peterson 2001; Rockafellar 1999; Mishra and Shukla 2010; Mishra et al. 2012, 2015; Mishra and Jaiswal 2015; Pandey and Mishra 2016, 2017, 2018). Recently, Mishra et al. (2016) formulate and study Wolfe and Mond–Weir type dual models for the mathematical programs with vanishing constraints. They establish the weak, strong, converse, restricted converse and strict converse duality results between the primal mathematical programs with vanishing constraints and the corresponding dual models under some assumptions. Since their models involve the calculation of index set, it is not conducive for the numerical solutions of dual problems.
In this paper, the new Wolfe and Mond–Weir type dual models for the mathematical programs with vanishing constraints are proposed which do not involve the calculations of index sets. Under the same assumptions as the ones of Mishra et al, the weak, strong, converse and restricted converse duality results between the primal mathematical programs with vanishing constraints and the corresponding new dual models are established. We also verify the validity of these results through an example.
The outline of this paper is as follows: in Sect. 2, we give some preliminaries about the MPVC. In Sect. 3, we give the new Wolfe and Mond–Weir type dual models for MPVC and some duality results. We close with some final remarks in Sect. 4.
2 Preliminaries
Let \(x^*\in X\) be any feasible point of the MPVC (1.1). The following index sets will be used in the sequel.
We also use the following Lagrangian function and its gradient:
and
We define the following index sets for \(x\in X\):
In order to establish the corresponding duality results, we give the following definitions and theorem which can be found in Achtziger and Kanzow (2008).
Definition 2.1
Let \(x^*\in X\) be a feasible point of the MPVC (1.1). The Abadie constraint qualification, denoted by ACQ, is said to hold at \(x^*\), iff \(T(x^*)=L(x^*)\), where
is the standard tangent cone of the MPVC (1.1) at \(x^*\), and
denotes the corresponding linearized cone of the MPVC (1.1) at \(x^*\).
Definition 2.2
Let \(x^*\in X\) be a feasible point of the MPVC (1.1). The VC-ACQ is said to hold at \(x^*\), iff \(L^{VC}(x^*)\subseteq T(x^*)\), where
denotes the corresponding VC-linearized cone of the MPVC (1.1) at \(x^*\).
Theorem 2.1
Let \(x^*\in X\) be a local minimum of the MPVC (1.1) such that VC-ACQ holds at \(x^*\). Then, there exist Lagrange multipliers \(\lambda _{i}\in R\ (i=1,2,\ldots ,m), \mu _{j}\in R\ (j\in I_h), \eta ^{H}_{i} ,\eta ^{G}_{i}\in R\ (i=1,2,\ldots ,l),\) such that
and
The following concepts of convexity and generalized convexity play a vital role during the establishment of some duality theorems.
Definition 2.3
Let \(S\subseteq R^n\) be any nonempty set and let \(f : R^n \rightarrow R\) be continuously differentiable. Then, f is said to be convex at \(x^* \in S \) on S, iff for any \(x\in S \), one has
Definition 2.4
Let \(S\subseteq R^n\) be any nonempty set and let \(f : R^n \rightarrow R\) be continuously differentiable. Then, f is said to be quasiconvex at \(x^* \in S \) on S, iff for any \(x\in S \), one has
Definition 2.5
Let \(S\subseteq R^n\) be any nonempty set and let \(f : R^n \rightarrow R\) be continuously differentiable. Then, f is said to be pseudoconvex at \(x^* \in S \) on S, iff for any \(x\in S \), one has
3 Two new duals for mathematical programms with vanishing constraints
Recently, Mishra et al. (2016) gives the Wolfe type dual and Mond–Weir type dual for the MPVC (1.1). It is noted that their models involve the calculation of the index set, which make it is complicated in the practical applications. In this section, we will propose the new Wolfe type and Mond–Weir type dual models which does not contain the calculation of index set. Also we will establish the weak and strong, converse, restricted converse (strictly converse) dual theorems under mild conditions. Moreover, we will utilize the example to explain their validity.
3.1 Wolfe and Mond–Weir type dual models proposed by Mishra et al
Firstly, we give the Wolfe type and Mond–Weir type duals of the MPVC (1.1) which were proposed by Mishra et al. (2016). For \(x\in X\), the Wolfe type and Mond–Weir type duals of the MPVC (1.1) are as follows:
Wolfe type dual model:
Mond–Weir type dual models:
Remark 3.1
For the above two models, we can directly see that they involve the calculation of the index set. So, it is difficult to deal with the dual problems from algorithm point of view, and this also limits the practicability of the models.
Subsequentially, we give the new dual models and establish the weak, strong, converse and restricted converse duality theorems.
3.2 New Wolfe type dual model
For \(x\in X\), the new Wolfe type dual of the MPVC (1.1), VC-WD(x) for short, is as follows:
Let \(S_w(x)\subseteq R^n\times R^m\times R^p\times R^l\times R^l\) denote the feasible set, i.e.,
We denote by
the projection of the set \(S_w(x)\) on \(R^n\).
To be independent of the MPVC (1.1), we consider another dual problem which is denoted by VC-WD as follows:
subject to
The set of all feasible points of the VC-WD is denoted by \(S_w=\cap _{x\in X}S_w(x)\) and the projection of the set \(S_w\) on \(R^n\) is denoted by \(prS_w\).
Remark 3.2
Compared with the new Wolfe dual model and the Wolfe dual model which was proposed by Mishra et al. (2016), we can obviously see that they do not involve the calculation of the index set for the above new Wolfe model. Moreover, it is not difficult to find that some signs of multiplier are different between the new Wolfe dual model and the Mishra et al’s Wolfe dual model. Firstly, \(\lambda _{i}\ge 0,\forall i=1,2,\ldots ,m\) is required in the new Wolfe dual model, but it only requires that \(\lambda _{i}\ge 0,\forall i\notin I_g(x)\) in the Mishra et al’s Wolfe dual model. Hence, our model can better explain the nonnegative of the multipliers corresponding to the inequality constraints \(g_i(x)\le 0,\ i=1,2,\ldots ,m\). Secondly, \(\eta _{i}^G=0,\forall i\in I_{0+}(x)\) is required in the new Wolfe dual model, but it requires that \(\eta _{i}^G\le 0,\forall i\in I_{0+}(x)\) in the Mishra et al’s Wolfe dual model. This implies that our model can better explain the complementary slackness of the multipliers corresponding to the constraint functions \(G_i(x),\ i\in I_{0+}(x)\).
Remark 3.3
In the new Wolfe dual model, the significance of \(\rho _i\) and \(\nu _i\) is the same as the one in Theorem 1 of Achtziger and Kanzow (2008). How to select them to evaluate the optimal solution can be found in Remark 1 of Achtziger and Kanzow (2008).
Firstly, we give the weak duality theorem. The theorem shows the relationship between a feasible point of the MPVC (1.1) and a feasible point of the new Wolfe type dual.
Theorem 3.1
Let \(x\in X,(y,\lambda ,\mu ,\eta ^{H},\eta ^{G},\rho ,v)\in S_w\) be feasible points for the MPVC (1.1) and the VC-WD, respectively. If one of the following conditions holds:
- (1)
\(L(\cdot ,\lambda ,\mu ,\eta ^{H},\eta ^{G})\) is convex at \(y\in X\cup prS_w\);
- (2)
\(f,g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-\,h_j(j\in I_h^-(x)),-H_i(i\in I_{+0}(x)\cup I_{+-}(x)\cup I_{00}(x)\cup I_{0-}(x)\cup I_{0+}^+(x)),-H_i(i\in I_{0+}^-(x)),-\,G_i(i\in I_{0+}(x)),G_i(i\in I_{00}(x)\cup I_{+0}(x)\cup I_{0-}(x)\cup I_{+-}(x))\) are convex at \(y\in X\cup prS_w\);
Then \(f(x)\ge L(y,\lambda ,\mu ,\eta ^{H},\eta ^{G})\).
Proof
(1) Suppose \(f(x)< L(y,\lambda ,\mu ,\eta ^{H},\eta ^{G})\),i.e.,
Since \(x\in X\) and (3.1), it follows that
that is,
Adding (3.4) and (3.5), one has
i.e.,
By the convexity of \(L(\cdot ,\lambda ,\mu ,\eta ^{H},\eta ^{G})\), it follows that
In view of the first equation in (3.1), one has \(L(x,\lambda ,\mu ,\eta ^{H},\eta ^{G})\ge L(y,\lambda ,\mu ,\eta ^{H},\eta ^{G})\). That is a contradiction to (3.6) and hence the result is proved.
(2) By the convexity of \(g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-h_j(j\in I_h^-(x)),-H_i(i\in I_{+0}(x)\cup I_{+-}(x)\cup I_{00}(x)\cup I_{0-}(x)\cup I_{0+}^+(x)), -H_i(i\in I_{0+}^-(x)),-G_i(i\in I_{0+}(x)),G_i(i\in I_{00}(x)\cup I_{+0}(x)\cup I_{0-}(x)\cup I_{+-}(x)\) at \(y\in X\cup prS_w\), \(x\in X,(y,\lambda ,\mu ,\eta ^{H},\eta ^{G},\rho ,v)\in S_w\), one has
which implies that
Also, by the convexity of f at \(y\in X\cup prS_w\), one has
Adding (3.7) and (3.8), one has
In view of the first equation in (3.1), one has
and hence the result is proved. \(\square \)
The following strong duality theorem gives the condition under which the new Wolfe dual is solvable and the global maximum can be obtained.
Theorem 3.2
Let \(x^*\in X\) be a local minimum of the MPVC (1.1), such that the VC-ACQ holds at \(x^*\). Then, there exist Lagrange multipliers \(\bar{\lambda }\in R^m,\bar{\mu }\in R^p,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v}\in R^l\), such that \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) is a feasible point of the VC-WD(\(x^*\)) and
Moreover, if one of the following conditions holds:
- (1)
\(L(\cdot ,\lambda ,\mu ,\eta ^{H},\eta ^{G})\) is convex at \(y\in X\cup prS_w(x^*)\);
- (2)
\(f,g_i(i\in I_g^+(x^*)),h_j(j\in I_h^+(x^*)),-\,h_j(j\in I_h^-(x^*)),-H_i(i\in I_{+0}(x^*)\cup I_{+-}(x^*)\cup I_{00}(x^*)\cup I_{0-}(x^*)\cup I_{0+}^+(x^*)), H_i(i\in I_{0+}^-(x^*)),-\,G_i(i\in I_{0+}(x^*)),G_i(i\in I_{00}(x^*)\cup I_{+0}(x^*)\cup I_{0-}(x^*)\cup I_{+-}(x^*))\) are convex at \(y\in X\cup prS_w(x^*)\);
Then, \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) is a global maximum of the VC-WD(\(x^*\)), that is,
and
Proof
Since \(x^*\) is local minimum of the MPVC (1.1) and the VC-ACQ condition is satisfied at \(x^*\), by Theorem 2.1, it follows that, there exist Lagrange multipliers \(\bar{\lambda }\in R^m,\bar{\mu }\in R^p,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v}\in R^l\), such that the conditions (2.4) and (2.5) hold and hence \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) is a feasible point of the VC-WD(\(x^*\)). By Theorem 3.1, one has
Adding (3.9) and (3.10), one has
that is, \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) is a global maximum of the VC-WD(\(x^*\)). Also, the local minimum of the MPVC (1.1) and the global minimum of the VC-WD(\(x^*\)) are equal. \(\square \)
The following theorem is a converse duality theorem. It gives the condition under which a feasible point of the new Wolfe dual generates a global minimum of the MPVC (1.1).
Theorem 3.3
Let \(x\in X\) be any feasible solution of the MPVC (1.1) and let \((y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\)\(\bar{\rho },\bar{v})\) be a feasible point of the VC-WD such that
Moreover, if one of the following conditions holds:
- (1)
\(L(\cdot ,\lambda ,\mu ,\eta ^{H},\eta ^{G})\) is convex at \( y^*\in X\cup prS_w\);
- (2)
\(f,g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-\,h_j(j\in I_h^-(x)),-\,H_i(i\in I_{+0}^+(x)\cup I_{+-}^+(x)\cup I_{00}^+(x)\cup I_{0-}^+(x)\cup I_{0+}^+(x)), -\,H_i(i\in I_{0+}^-(x)), G_i(i\in I_{+0}^{++}(x)\cup \in I_{+-}^{++}(x))\) are convex at \(y^*\in X\cup prS_w\);
Then, \(y^*\) is a global minimum of the MPVC (1.1).
Proof
Suppose to the contrary that \(y^*\) is not a global minimum of the MPVC (1.1), i.e., there exists \(\tilde{x}\in X\) such that
(1) Since \(\tilde{x}\) and \((y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) be the feasible point for the MPVC (1.1) and the VC-WD, respectively. Combining the hypothesis in the theorem, one has
Adding (3.11) and (3.12), one has
By the convexity of \(L(\cdot ,\lambda ,\mu ,\eta ^{H},\eta ^{G})\) at \( y^*\in X\cup prS_w\), it follows that
this is a contradiction to the dual constraint (3.1) of the VC-WD (x) and hence the result is proved.
(2) Since \(\tilde{x}\) and \((y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) be the feasible point for the MPVC (1.1) and the VC-WD, respectively. Combining the hypothesis in the theorem, one has
By the convexity of the fuction in the theorem, it follows that
which implies that
Using the above inequality and (3.1), one has
By the convexity of f, it follows that
this is a contradiction to our hypothesis and hence the result is proved. \(\square \)
The following theorem is restricted converse duality theorem which gives a sufficient condition for a feasible point of the MPVC (1.1) to be a global minimum by using the new Wolfe dual.
Theorem 3.4
Let \(x^*\in X\) be a feasible point of the MPVC (1.1) and let \((y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) be a feasible point of the VC-WD such that \(f(x^*)=L(y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G)\). Moreover, if one of the following conditions holds:
- (1)
\(L(\cdot ,\bar{\lambda },\bar{\mu },\bar{\eta }^{H},\bar{\eta }^{G})\) is convex at \( y^*\in X\cup prS_w\);
- (2)
\(f,g_i(i\in I_g^+(x^*)),h_j(j\in I_h^+(x^*)),-h_j(j\in I_h^-(x^*)),-H_i(i\in I_{+0}^+(x^*)\cup I_{+-}^+(x^*)\cup I_{00}^+(x^*)\cup I_{0-}^+(x^*)\cup I_{0+}^+(x^*)),-H_i(i\in I_{0+}^-(x^*)), G_i(i\in I_{+0}^{++}(x^*)\cup \in I_{+-}^{++}(x^*))\) are convex at \(y^*\in X\cup prS_w\);
Then, \(x^*\) is a global minimum of the MPVC (1.1).
Proof
Suppose to the contrary that \(x^*\in X\) is not a global minimum of the MPVC (1.1), then there exists \(\tilde{x}\in X\) such that
Combining the assumption in the theorem, it follows that
a contradiction to the Theorem 3.1 and hence the result is proved. \(\square \)
The following strict converse duality theorem gives a sufficient condition about the uniqueness of a local minimum of the MPVC (1.1) and a global maximum of the new Wolfe dual model.
Theorem 3.5
Let \(x^*\in X\) be a local minimum for the MPVC (1.1) such that the VC-ACQ at \(x^*\). Assume the conditions of Theorem 3.2 hold and \((y^*,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^{H},\tilde{\eta }^{G},\tilde{\rho },\tilde{v})\) be a global maximum of the VC-WD(\(x^*\)). If one of the following conditions holds:
- (1)
\(L(\cdot ,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^{H},\tilde{\eta }^{G})\) is strictly convex at \(y\in X\cup prS_w(x^*)\);
- (2)
f is strictly convex and \(g_i(i\in I_g^+(x^*)),h_j(j\in I_h^+(x^*)),-h_j(j\in I_h^-(x^*)),-H_i(i\in I_{+0}(x^*)\cup I_{+-}(x^*)\cup I_{00}(x^*)\cup I_{0-}(x^*)\cup I_{0+}^+(x^*)),-H_i(i\in I_{0+}^-(x^*)),-G_i(i\in I_{0+}(x^*)),G_i(i\in I_{00}(x^*)\cup I_{+0}(x^*)\cup I_{0-}(x^*)\cup I_{+-}(x^*))\) are convex at \(y\in X\cup prS_w(x^*)\).
Then \(x^*=y^*\).
Proof
(1) Suppose that \(x^*\ne y^*\). By Theorem 3.2, there exist Lagrange multipliers \(\bar{\lambda }\in R^m,\ \bar{\mu }\in R^p,\ \bar{\eta }^{G}\in R^l,\ \bar{\eta }^{H}\in R^l,\bar{\rho }\in R^l,\bar{v}\in R^l\) such that \((y^*,\bar{\lambda },\bar{\mu },\bar{\eta }^{H},\bar{\eta }^{G},\bar{\rho },\bar{v})\) be a global maximum of the VC-WD(\(x^*\)). Hence,
In view of the feasibility of \(x^*\) for the MPVC (1.1) and the feasibility of \((y^*,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^{H},\tilde{\eta }^{G},\tilde{\rho },\tilde{v})\) for the VC-WD(\(x^*\)), it follows that
that is,
Adding (3.13) and (3.14), one has
By the strict convexity of \(L(\cdot ,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^{H},\tilde{\eta }^{G})\), it follows that
That is a contradiction to the first equation in (3.1) and hence the result is proved.
(2) By the strict convexity of f at \(y^*\), one has
In view of the convexity of \(g_i(i\in I_g^+(x^*)),h_j(j\in I_h^+(x^*)),-h_j(j\in I_h^-(x^*)),-H_i(i\in I_{+0}(x^*)\cup I_{+-}(x^*)\cup I_{00}(x^*)\cup I_{0-}(x^*)\cup I_{0+}^+(x^*)), -H_i(i\in I_{0+}^-(x^*)),-G_i(i\in I_{0+}(x^*)),G_i(i\in I_{00}(x^*)\cup I_{+0}(x^*)\cup I_{0-}(x^*)\cup I_{+-}(x^*)\) at \(y^*\in X\cup prS_w(x^*)\), \(x^*\in X\) and \((y^*,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^{H},\tilde{\eta }^{G},\tilde{\rho },\tilde{v})\in S_w(x^*)\), one has
which implies that
Adding (3.16) and (3.17), one has
This is a contradiction to (3.13) and hence the result is proved. \(\square \)
In order to verify the validity of the new Wolfe dual model and the related theorems, we give the following example.
Example 1
Consider the following MPVC
with \(n=2,m=p=0,l=1\). The new Wolfe dual model to (3.18) is given by
(1) Let \(x^*=(0,0)^T \in X, (y,\eta _1^{H},\eta _1^{G},\rho _1,v_1)=(0,0,0,0,0)\in S_W (x^*),\) one has
It can be verified that the hypothesis of Theorem 3.4 holds, since the positive definiteness of \(\nabla ^2 L(y,\eta _1^{H},\eta _1^{G})=\left( \begin{array}{ccc} 2 &{} 0\\ 0 &{} 2\\ \end{array} \right) \). Taking account (3.18), \(x^*\) is a global minimum of (3.18). So, Theorem 3.4 is verified.
(2) We can get \(y_1=-\frac{1}{2} \eta _1^G,y_2=\frac{1}{2} \eta _1^H\) by (3.19). One has also
Since \(f(x)=x_1^2+x_2^2 \ge 0\), we can get \(f(x)\ge L(y,\eta _1^{H},\eta _1^{G})\), Hence, Theorem 3.1 is verified.
(3) We can obtain that (3.18) satisfy VC-LICQ, since \(\nabla H_1=(0,1)^T,\nabla G_1=(1,0)^T\). So we obtain that (3.18) satisfies VC-ACQ. By Theorem 2.1, there exist Lagrange multipliers \(\eta _1^{H},\eta _1^{G},\rho _1,v_1\in R\) such that \((0,\eta _1^{H},\eta _1^{G},\rho _1,v_1)\) is a feasible point of the VC-WD(0) and
So, \((0,\eta _1^{H},\eta _1^{G},\rho _1,v_1)\) is a global maximum of the VC-WD(0) and \(f(0)=0=L(0,\eta _1^{H},\eta _1^{G})\). Theorem 3.2 is verified.
3.3 New Mond–Weir type dual model
In this section, we discuss the new Mond–Weir type dual for MPVC (1.1). For \(x\in X\), the new Mond–Weir type dual of the MPVC (1.1), VC-MWD(x) for short, is as follows:
Let \(S_{MW}(x)\subseteq R^n\times R^m\times R^p\times R^l\times R^l\) denote feasible point set, i.e.
We denote by
the projection of the set \(S_{MW}(x)\) on \(R^n\).
Similar to the new Wolfe dual, we also consider another dual problem which is denoted by VC-MWD as follows:
The set of all feasible points of the VC-MWD is denoted by \(S_{MW}=\cap _{x\in X}S_{MW}(x)\) and the projection of the set \(S_{MW}\) on \(R^n\) is denoted by \(prS_{MW}\).
Remark 3.4
From the new Mond–Weir type dual model and the Mond–Weir type dual model which was proposed by Mishra et al. (2016), we can also see that they do not involve the calculation of the index set for the above new Mond–Weir type model. Moreover, it is not difficult to find that some signs of multiplier are different between the new Mond–Weir type dual model and the Mishra et al’s Mond–Weir type dual model. Firstly, \(\eta _{i}^G\ge 0,\forall i\in I_{00}(x)\cup I_{+0}(x),\ \eta _i^G=0,\ i\in I_{0+}(x)\) is required in the new Mond–Weir dual model, but it requires that \(\eta _{i}^G\in R,\forall i\in I_{00}(x)\cup I_{+0}(x),\ \eta _i^G\le 0,\ i\in I_{0+}(x)\) in the Mishra et al’s Mond–Weir dual model, i.e., the signs of \(\eta _i^G,\ i\in I_{00}(x)\cup I_{+0}(x)\cup I_{0+}(x)\) in our model are the same as the ones in Theorem 1 of Achtziger and Kanzow (2008). This shows that our model can better explain the complementary slackness and the nonnegative of the multipliers corresponding to the constraint function \(G_i(x),\ i\in I_{00}(x)\cup I_{+0}(x)\cup I_{0+}(x)\). Secondly, \(\eta _{i}^H\ge 0,\forall i\in I_{00}(x)\cup I_{0-}(x),\ \eta _{i}^H\in R,\ i\in I_{0+}(x)\) is required in the new Mond–Weir dual model, but it requires that \(\eta _{i}^H\in R,\forall i\in I_{00}(x)\cup I_{0-}(x)\cup I_{0+}(x)\) in the Mishra et al’s Mond–Weir dual model, i.e., the signs of \(\eta _i^H,\ i\in I_{00}(x)\cup I_{0-}(x)\cup I_{0+}(x)\) in our model are the same as the ones in Theorem 1 of Achtziger and Kanzow (2008). This implies that our model can better explain the nonnegative of the multipliers corresponding to the constraint functions \(H_i(x),\ i\in I_{00}(x)\cup I_{0-}(x)\cup I_{0+}(x)\).
Remark 3.5
Similar to the new Wolfe dual model, the significance of \(\rho _i\) and \(\nu _i\) is also the same as the one in Theorem 1 of Achtziger and Kanzow (2008). The method about selecting these parameters to evaluate the optimal solution can also be found in Remark 1 of Achtziger and Kanzow (2008).
The following weak duality theorem shows the relationship between a feasible point of the MPVC (1.1) and a feasible point of the new Mond–Weir type dual.
Theorem 3.6
Let \(x\in X\) and \((y,\lambda ,\mu ,\eta ^H,\eta ^G,\rho ,v)\in S_{MW}\) be feasible points for the MPVC (1.1) and the VC-MWD, respectively. Moreover, if one of the following conditions holds:
- (1)
\(f(\cdot )\) is pseudoconvex and \(\sum \limits _{i=1}^{m}\lambda _{i}g_{i}(\cdot )+\sum \limits _{j=1}^{p}\mu _{j}h_{j}(\cdot )-\sum \limits _{i=1}^{l}\eta _{i}^{H}H_{i}(\cdot )+\sum \limits _{i=1}^{l} \eta _{i}^{G}G_{i}(\cdot )\) is quasiconvex at \( y\in X\cup prS_{MW}\), respectively;
- (2)
\(f(\cdot )\) is pseudoconvex and \(g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-h_j(j\in I_h^-(x)),-H_i(i\in I_{+0}^+(x)\cup I_{+-}^+(x)\cup I_{00}^+(x)\cup I_{0-}^+(x)\cup I_{0+}^+(x)),-H_i(i\in I_{0+}^-(x)),G_i(i\in I_{+0}^{++}(x)\cup \in I_{+-}^{++}(x))\) are quasiconvex at \(y\in X\cup prS_{MW}\),respectively;
Then, \(f(x)\ge f(y)\).
Proof
(1) Since \(x\in X\) and \((y,\lambda ,\mu ,\eta ^H,\eta ^G,\rho ,v)\in S_{MW}\), it follows that
By (3.20), it implies that
Combining the quasiconvexity of \(\sum \limits _{i=1}^{m} \lambda _{i}g_{i}(\cdot )+\sum \limits _{j=1}^{p} \mu _{j}h_{j}(\cdot )-\sum \limits _{i=1}^{l}\eta _{i}^{H}H_{i}(\cdot )+\sum \limits _{i=1}^{l} \eta _{i}^{G}G_{i}(\cdot )\), one has
Using the above inequality and the first equation in (3.20), one has
By the pseudoconvexity of f, it implies that
and hence the result is proved.
(2) By \(x\in X\), \((y,\lambda ,\mu ,\eta ^H,\eta ^G,\rho ,v)\in S_{MW}\), it follows that
By the quasiconvexity of \(f,g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-h_j(j\in I_h^-(x)),-H_i(i\in I_{+0}^+(x)\cup I_{+-}^+(x)\cup I_{00}^+(x)\cup I_{0-}^+(x)\cup I_{0+}^+(x)), H_i(i\in I_{0+}^-(x)),G_i(i\in I_{+0}^{++}(x)\cup \in I_{+-}^{++}(x))\), it implies that
From the above inequalities and (2.3), it follows that
Combining the above inequality and (3.20), one has
By the pseudoconvexity of f, it implies that
and hence the result is proved. \(\square \)
The following strong duality theorem gives the condition under which the new Mond–Weir dual is solvable and the global maximum can be obtained.
Theorem 3.7
Let \(x^*\in X\) be a local minimum of the MPVC (1.1) such that the VC-ACQ holds at \(x^*\). Then, there exist Lagrange multipliers \(\bar{\lambda }\in R^m,\bar{\mu }\in R^p,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v}\in R^l\), such that \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) is a feasible point of the VC-MWD(\(x^*\)), that is, \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\in S_{MW}(x^*)\). Moreover, Theorem 3.6 holds, then \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G)\) is a global maximum of the VC-MWD(\(x^*\)).
Proof
Since \(x^*\in X\) is a local minimum of the MPVC (1.1) and the VC-ACQ condition is satisfied at \(x^*\). By theorem 2.1, it follows that, there exist Lagrange multipliers \(\bar{\lambda }\in R^m,\bar{\mu }\in R^p,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v}\in R^l\) such that the conditions (2.4) and (2.5) hold and hence \((x^*,\bar{\lambda },\bar{\mu },\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\) is a feasible point of the VC-MWD(\(x^*\)). By Theorem 3.6, it follows that
and hence \((x^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\in S_{MW}(x)\) is a global maximum of the VC-MWD(\(x^*\)). \(\square \)
The following converse duality theorem gives the condition under which a feasible point of the new Mond–Weir dual generates a global minimum of the MPVC (1.1).
Theorem 3.8
Let \(x\in X\) and \((y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\in S_{MW}\) be feasible points for the MPVC (1.1) and the VC-MWD, respectively. Moreover, if one of the following conditions holds:
- (1)
\(f(\cdot )\) is pseudoconvex and \(\sum \limits _{i=1}^{m} \bar{\lambda }_{i}g_{i}(\cdot )+\sum \limits _{j=1}^{p} \bar{\mu }_{j}h_{j}(\cdot )-\sum \limits _{i=1}^{l}\bar{\eta }_{i}^{H}H_{i}(\cdot )+\sum \limits _{i=1}^{l} \bar{\eta }_{i}^{G}G_{i}(\cdot )\) is quasiconvex at \(y^*\in X\cup prS_{MW}\), respectively;
- (2)
\(f(\cdot )\) is pseudoconvex and \(g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-h_j(j\in I_h^-(x)),-H_i(i\in I_{+0}^+(x)\cup I_{+-}^+(x)\cup I_{00}^+(x)\cup I_{0-}^+(x)\cup I_{0+}^+(x)),-H_i(i\in I_{0+}^-(x)),G_i(i\in I_{+0}^{++}(x)\cup \in I_{+-}^{++}(x))\) are quasiconvex at \(y^*\in X\cup prS_{MW}\); Then \(y^*\) is a global minimum of the MPVC (1.1).
Proof
Suppose to the contrary that \(y^*\) is not a global minimum of the MPVC (1.1), that is, there exists \(\tilde{x}\in X\), such that \(f(\tilde{x})< f(y^*)\).
(1) By the pseudoconvexity of \(f(\cdot )\), one has
Since \(\tilde{x}\in X\), \((y^*,\bar{\lambda },\bar{\mu } ,\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\in S_{MW}\), one has
which implies that
By the quasiconvexity of \(\sum \limits _{i=1}^{m}\bar{\lambda }_{i}g_{i}(\cdot )+\sum \limits _{j=1}^{p}\bar{\mu }_{j}h_{j}(\cdot )-\sum \limits _{i=1}^{l}\bar{\eta }_{i}^{H}H_{i}(\cdot )+\sum \limits _{i=1}^{l} \bar{\eta }_{i}^{G}G_{i}(\cdot )\), it follows that
Adding the inequalities (3.22) and (3.23), one has
this is a contradiction to (3.20) and hence the result is proved.
(2) Since \(\tilde{x}\in X\), \((y^*,\bar{\lambda },\bar{\mu },\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\in S_{MW}\), one has
Using the above inequalities and (2.3), it follows that
By the quasiconvexity of \(g_i(i\in I_g^+(x)),h_j(j\in I_h^+(x)),-h_j(j\in I_h^-(x)),-H_i(i\in I_{+0}^+(x)\cup I_{+-}^+(x)\cup I_{00}^+(x)\cup I_{0-}^+(x)\cup I_{0+}^+(x)), H_i(i\in I_{0+}^-(x)),G_i(i\in I_{+0}^{++}(x)\cup \in I_{+-}^{++}(x))\), it implies that
Then, it follows that
Combining the above inequality and (3.20), one has
By the pseudoconvexity of \(f(\cdot )\), it implies that
this is a contradiction to our hypothesis and hence the result is proved. \(\square \)
The following restricted converse duality theorem gives a sufficient condition for a feasible point of the MPVC (1.1) to be a global minimum by utilizing the new Mond–Weir dual.
Theorem 3.9
Let \(x^*\in X\) and \((y^*,\bar{\lambda },\bar{\mu },\bar{\eta }^H,\bar{\eta }^G,\bar{\rho },\bar{v})\in S_{MW}\) be feasible points for the MPVC (1.1) and the VC-MWD, respectively, such that \(f(x^*)=f(y^*)\). If the hypothesis of theorem 3.6 holds at \(y^*\in X\cup prS_{MW} \), then \(x^*\) is a global minimum of the MPVC (1.1).
Proof
Suppose to the contrary that \(x^*\in X\) is not a global minimum of the MPVC (1.1), then there exists \(\tilde{x}\in X\) such that
From the assumptions in the theorem, it follows that
this is a contradiction to the Theorem 3.6 and hence the result is proved. \(\square \)
The following strict converse duality theorem gives a sufficient condition about the uniqueness of a local minimum of the MPVC (1.1) and a global maximum of the new Wolfe dual model.
Theorem 3.10
Let \(x^*\in X\) be a local minimum for the MPVC (1.1) such that the VC-ACQ at \(x^*\). Assume the conditions of Theorem 3.7 hold and \((y^*,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^{H},\tilde{\eta }^{G},\tilde{\rho },\tilde{v})\) be a global maximum of the VC-WD(\(x^*\)). If one of the following conditions holds:
- (1)
\(f(\cdot )\) is strictly pseudoconvex and \(\sum \limits _{i=1}^{m}\tilde{\lambda }_{i}g_{i}(\cdot )+\sum \limits _{j=1}^{p}\tilde{\mu }_{j}h_{j}(\cdot )-\sum \limits _{i=1}^{l}\tilde{\eta }_{i}^{H}H_{i}(\cdot )+\sum \limits _{i=1}^{l} \tilde{\eta }_{i}^{G}G_{i}(\cdot )\) is quasiconvex at \(y^*\in X\cup prS_{MW}(x^*)\), respectively;
- (2)
\(f(\cdot )\) is strictly pseudoconvex and \(g_i(i\in I_g^+(x^*)),h_j(j\in I_h^+(x^*)),-h_j(j\in I_h^-(x^*)),-H_i(i\in I_{+0}^+(x^*)\cup I_{+-}^+(x^*)\cup I_{00}^+(x^*)\cup I_{0-}^+(x^*)\cup I_{0+}^+(x^*)),-H_i(i\in I_{0+}^-(x^*)),G_i(i\in I_{+0}^{++}(x^*)\cup \in I_{+-}^{++}(x^*))\) are quasiconvex at \(y^*\in X\cup prS_{MW}(x^*)\), respectively;
Then, \(x^*\ne y^*\).
Proof
(1) Suppose that \(x^*\ne y^*\). By Theorem 3.7, there exist Lagrange multipliers \(\bar{\lambda }\in R^m,\ \bar{\mu }\in R^p,\ \bar{\eta }^{G}\in R^l,\ \bar{\eta }^{H}\in R^l,\bar{\rho }\in R^l,\bar{v}\in R^l\) such that \((y^*,\bar{\lambda },\bar{\mu },\bar{\eta }^{H},\bar{\eta }^{G},\bar{\rho },\bar{v})\) be a global maximum of the VC-MWD(\(x^*\)). Hence,
Since \(x^*\in X\) and \((y^*,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^H,\tilde{\eta }^G,\tilde{\rho },\tilde{v})\in S_{MW}\), it follows that
By (3.20), it implies that
Combining the quasiconvexity of \(\sum \limits _{i=1}^{m} \tilde{\lambda }_{i}g_{i}(\cdot )+\sum \limits _{j=1}^{p} \tilde{\mu }_{j}h_{j}(\cdot )-\sum \limits _{i=1}^{l}\tilde{\eta }_{i}^{H}H_{i}(\cdot )+\sum \limits _{i=1}^{l} \tilde{\eta }_{i}^{G}G_{i}(\cdot )\), one has
Using the above inequality and the first equation in (3.20), one has
By the strictly pseudoconvexity of f, it implies that
This is a contradiction to (3.24) and hence the result is proved.
(2) By using \(x^*\in X\), \((y^*,\tilde{\lambda },\tilde{\mu },\tilde{\eta }^H,\tilde{\eta }^G,\tilde{\rho },\tilde{v})\in S_{MW}(x^*)\), it follows that
In view of the quasiconvexity of \(g_i(i\in I_g^+(x^*)),h_j(j\in I_h^+(x^*)),-h_j(j\in I_h^-(x^*)),-H_i(i\in I_{+0}^+(x^*)\cup I_{+-}^+(x^*)\cup I_{00}^+(x^*)\cup I_{0-}^+(x^*)\cup I_{0+}^+(x^*)), H_i(i\in I_{0+}^-(x^*)),G_i(i\in I_{+0}^{++}(x^*)\cup \in I_{+-}^{++}(x^*))\), it implies that
From the above inequalities and (2.3), it follows that
Combining the above inequality and (3.20), one has
By the strictly pseudoconvexity of f, it implies that
This is a contradiction to (3.24) and hence the result is proved.
In order to verify the validity of the new Mond–Weir type dual, we continue to consider (3.18).
Example 2
For (3.18), its new Mond–Weir dual model is given by
(1) Let \(x^*=(0,0)^T \in X, (y^*,\eta _1^{H},\eta _1^{G},\rho _1,v_1)=(0,0,0,0,0)\in S_{MW}\) one has
It can be verified that the hypothesis of Theorem 3.8 hold, since the positive definiteness of \(\nabla ^2 L(y,\eta _1^{H},\eta _1^{G})=\left( \begin{array}{ccc} 2 &{} 0\\ 0 &{} 2\\ \end{array} \right) \). Taking into account (3.18), \(x^*\) is a global minimum of (3.18). So, Theorem 3.8 is verified.
(2) We can get \(y_1=-\frac{1}{2} \eta _1^G,y_2=\frac{1}{2} \eta _1^H\) by (3.25), one has
which implies that
combining (3.25), one has \(f(y)\le 0\). Since \(f(x)=x_1^2+x_2^2 \ge 0\), we can get \(f(x)\ge f(y)\). Theorem 3.6 is verified.
(3) We can obtain that (3.18) satisfy VC-LICQ, since \(\nabla H_1=(0,1)^T,\nabla G_1=(1,0)^T\). So we obtain that (3.18) satisfy VC-ACQ. By Theorem 2.1, there exist Lagrange multipliers \(\eta _1^{H},\eta _1^{G},\rho _1,v_1\in R\) such that \((0,\eta _1^{H},\eta _1^{G},\rho _1,v_1)\) is a feasible point of the VC-MWD(0). Taking into account \(f(y)\le 0\), \((0,\eta _1^{H},\eta _1^{G},\rho _1,v_1)\) is a global maximum of the VC-MWD(0) and Theorem 3.7 is verified.
4 Conclusions
In this paper, we have formulated new Wolfe and Mond–Weir type dual models to the MPVC and have established the weak, strong, converse and restricted converse duality results under the assumptions of convexity, strict convexity, pseudoconvexity, strict pseudoconvexity and quasiconvexity. Also, the validity of the results is verified by an example. As the future work, some other dual models for the MPVC, like the mixed type dual, may be investigated by relaxing the convexity and generalized convexity assumptions.
References
Achtziger, W., Hoheisel, T., & Kanzow, C. (2012). On a relaxation method for mathematical programs with vanishing constraints. GAMM-Mitteilungen, 35(2), 110–130.
Achtziger, W., Hoheisel, T., & Kanzow, C. (2013). A smoothing-regularization approach to mathematical programs with vanishing constraints. Computation Optimization and Applications, 55(3), 733–767.
Achtziger, W., & Kanzow, C. (2008). Mathematical programs with vanishing constraints: Optimality conditions and constraints qualifications. Mathematical Programming, 114(1), 69–99.
Antczak, T. (2010). G-saddle point criteria and G-Wolfe duality in differentiate mathematical programming. Journal of Information and Optimization Sciences, 31(1), 63–85.
Askar, S. S., & Tiwari, A. (2009). First-order optimality conditions and duality results for multi-objective optimization problems. Annals of Operations Research, 172(1), 277–289.
Benko, M., & Gfrerer, H. (2017). An SQP method for mathematical programs with vanishing constraints with strong convergence properties. Computation Optimization and Applications, 11(3), 641–653.
Bot, R. I., & Heinrich, A. (2014). Regression tasks in machine learning via Fenchel duality. Annals of Operations Research, 222(1), 197–211.
Chinchuluun, A., Yuan, D., & Pardalos, P. M. (2007). Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity. Annals of Operations Research, 154(1), 133–147.
Dorsch, D., Shikhman, V., & Stein, O. (2012). Mathematical programs with vanishing constraints: Critical point theory. Journal of Global Optimization, 52(3), 591–605.
Gulati, T. R., & Mehndiratta, G. (2010). Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones. Optimization Letters, 4(2), 293–309.
Hoheisel, T., & Kanzow, C. (2007). First- and second-order optimality conditions for mathematical programs with vanishing constraints. Applied Mathematics, 52(6), 495–514.
Hoheisel, T., & Kanzow, C. (2008). Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualification. Journal of Mathematical Analysis and Applications, 337(1), 292–310.
Hoheisel, T., & Kanzow, C. (2009). On the Abadie and Guignard constraint qualification for mathematical programs with vanishing constraints. Optimization, 58(4), 431–448.
Hoheisel, T., Kanzow, C., & Outrata, J. V. (2010). Exact penalty results for mathematical programs with vanishing constraints. Nonlinear Analysis, 72(5), 2514–2526.
Hoheisel, T., Kanzow, C., & Schwartz, A. (2012). Convergence of a local regularization approach for mathematical programs with complementarity or vanishing constraints. Optimization Methods and Software, 27(3), 483–512.
Hu, Q. J., Chen, Y., Zhu, Z. B., & Zhang, B. S. (2014). Notes on some convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints. Abstract and Applied Analysis, 2014(1), 1–7.
Hu, Q. J., Wang, J. G., Chen, Y., & Zhu, Z. B. (2017). On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints. Optimization Letters, 11(3), 641–653.
Izmailov, A. F., & Pogosyan, A. L. (2009). Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints. Computation Mathematics and Mathematics Physics, 49(7), 1128–1140.
Izmailov, A. F., & Solodov, M. V. (2009). Mathematical programs with vanishing constraints: Optimality conditions, sensitivity and a relaxation method. Journal of Optimization Theory and Applications, 142(3), 501–532.
Jabr, R. A. (2012). Solution to economic dispatching with disjoint feasible regions via semidefinite programming. IEEE Transactions on Power Systems, 27(1), 572–573.
Jefferson, T. R., & Scott, C. H. (2001). Quality tolerancing and conjugate duality. Annals of Operations Research, 105(1–4), 185–200.
Kirches, C., Potschka, A., Bock, H. G., & Sager, S. (2013). A parametric active set method for quadratic programs with vanishing constraints. Pacific Jounal of Optimization, 9(2), 275–299.
Lai, H. C., & Huang, T. Y. (2012). Nondifferentiable minimax fractional programming in complex spaces with parametric duality. Journal of Global Optimization, 53(2), 243–254.
Lee, J. C., & Lai, H. C. (2005). Parameter-free dual models for fractional programming with generalized invexity. Annals of Operations Research, 133(1–4), 47–61.
Michael, N. J., Kirches, C., & Sager, S. (2013). On perspective functions and vanishing constraints in mixedinteger nonlinear optimal control. In M. Jünger & G. Reinelt (Eds.), Facets of combinatorial optimization (pp. 387–417). Berlin: Springer.
Mishra, S. K., & Jaiswal, M. (2015). Optimality conditions and duality for semi-infinite mathematical programming problem with equilibrium constraints. Journal Numerical Functional Analysis and Optimization, 36(4), 460–480.
Mishra, S. K., Jaiswal, M., & An, L. T. H. (2012). Duality for nonsmooth semi-infinite programming problems. Optimization Letters, 6(2), 261–271.
Mishra, S. K., & Shukla, K. (2010). Nonsmooth minimax programming problems with V-r-invex functions. Optimization, 59(1), 95–103.
Mishra, S. K., Singh, V., & Laha, V. (2016). On duality for mathematical programs with vanishing constraints. Annals of Operations Research, 243(1), 249–272.
Mishra, S. K., Singh, V., Laha, V., & Mohapatra, R. N. (2015). On constraint qualifications for multiobjective optimization problems with vanishing constraints. In H. Xu, S. Wang & S. Y. Wu (Eds.), Optimization methods, theory and applications (pp. 95–135). Berlin: Springer.
Mond, B., & Weir, T. (1981). Generalized concavity and duality. In S. Schaible & W. T. Ziemba (Eds.), Generalized concavity in optimization and economics (pp. 263–279). New York: Academic Press.
Pandey, Y., & Mishra, S. K. (2016). Duality for nonsmooth optimization problems with equilibrium constraints using convexificators. Journal of Optimization Theory and Applications, 171(2), 694–707.
Pandey, Y., & Mishra, S. K. (2017). Duality of mathematical programming problems with equilibrium constraints. Pacific Journal of Optimization, 13(1), 105–122.
Pandey, Y., & Mishra, S. K. (2018). Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators. Annals of Operations Research, 269(2), 549–564.
Peterson, E. L. (2001). The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality. Annals of Operations Research, 105(1–4), 109–153.
Rockafellar, R. T. (1999). Duality and optimality in multistagestochastic programming. Annals of Operations Research, 85(1), 1–19.
Wolfe, P. (1961). A duality theorem for nonlinear programming. Quarterly of Applied Mathematics, 19, 239–244.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is supported by National Natural Science Foundation of China (No. 11461015, 11961011, 11761014) of China, Guangxi Natural Science Foundation (No. 2015GXNSFAA139010, 2016GXNSFFA380009, 2017GXNSFAA198243) and Guangxi Key Laboratory of Automatic Detecting Technology (No.YQ17117).
Rights and permissions
About this article
Cite this article
Hu, Q., Wang, J. & Chen, Y. New dualities for mathematical programs with vanishing constraints. Ann Oper Res 287, 233–255 (2020). https://doi.org/10.1007/s10479-019-03409-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-019-03409-6