The talk deals with the numerical resolution of MPEC problems (Mathematical Programming with Equilibrium Constraints). The algorithm proposed is based on a penalization of the complementary constraint, and the use of a DC method (Difference of Convex functions) to solve the penalized problem. The talk studies the convergence of this algorithm, the feasibility of the limits of the sequence generated by this algorithm and their stationarity properties.