In this talk, we consider a mathematical program with equilibrium constraints (MPEC), where the objective and the constraint functions are all real polynomials. We present a method for finding its global minimizers and global minimum using a hierarchy of semidefinite programming (SDP) relaxations. The convergence result for our method is proved, and numerical experiments are also presented to show the efficiency of the proposed algorithm.