On Wolfe duality for mathematical programs with equilibrium constraints using directional convexificators

In this paper, we consider a mathematical programming problem with equilibrium constraints (MPEC), where its functions are not necessarily smooth, continuous, or locally Lipschitz. Using directional convexificators, initially developed by Dempe and Pickela (Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming, J. Glob. Optim. 61:769–788, 2015), we investigate the Wolfe-type dual problem under generalized convexity assumptions.