we study variational inequality problems (vips) with involved mappings and feasible sets characterized by polynomial functions (namely, polynomial vips). we propose a numerical algorithm for computing solutions to polynomial vips based on lagrange multiplier expressions and the moment-sos hierarchy of semidefinite relaxations. we also extend our approach to finding more or even all solutions to polynomial vips. we show that the method proposed in this paper can find solutions or detect the nonexistence of solutions within finitely many steps, under some general assumptions. in addition, we show that if the vip is given by generic polynomials, then it has finitely many karush-kuhn-tucker points, and our method can solve it within finitely many steps. numerical experiments are conducted to illustrate the efficiency of the proposed methods.