New dualities for mathematical programs with vanishing constraints

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.