Abstract:

This article discusses feasibility conditions in mathematical programs with equilibrium constraints (MPECs). The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors show that the two feasibility conditions are different from the feasibility condition in [2, 3], and show that the sufficient condition in [3] is stronger than that in [2].

Key words: Mathematical programs with equilibrium constraints, constraints,
feasibility, complementarity problem, quadratic program