Modified relaxation method for mathematical programs with complementarity constraints

In this paper, we suggest a new relaxation method for solving mathematical programs with complementarity constraints. This method can be regarded as a modification of a method proposed in a recent paper (J. Opt. Theory Appl. 2003; 118:81-116). We show that the main results remain true for the modified method and particularly, some conditions assumed in the previous paper can be removed.