Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257)

The authors deal with convergence properties of five relaxation methods for solving mathematical programs with equilibrium constraints (MPECs). Several existed convergence results are improved and some new results regarding the satisfaction of standard constraint qualifications for the relaxed problems are obtained. They present a numerical comparison of these methods based on the MacMPEC test problem collection. Numerical results favour the oldest relaxation scheme due to Scholtes.