Saddle point optimality criteria for mathematical programming problems with equilibrium constraints

In this paper, we consider a mathematical programming problem with equilibrium constraints (MPEC). We formulate the Lagrange type dual model for the MPEC and establish weak and strong duality results under convexity assumptions. Further, we investigate the saddle point optimality criteria for the MPEC. We also illustrate our results by an example.