Lagrange type duality and saddle point optimality criteria for mathematical programming problems with vanishing constraints

Yadvendra Singh, S. K. Mishra

In this paper, we consider a special class of optimization problem
known as the mathematical problem with vanishing constraints (MPVC). We
formulate the Lagrange type dual model for the MPVC and establish weak
and strong duality results under generalized convexity assumptions. Further,
we investigate the saddle point optimality criteria for the MPVC. We also
illustrate our results by an example.