For vector polynomial optimization problem, the objective function and constraint condition are all described in polynomial. Firstly, the multi-objective polynomial function is transformed into the single-objective polynomial function by using the main objective method, linear weighted sum method and ideal point method respectively. Then Lasserre relaxation method is applied to solve the polynomial optimization problem, and its optimal solution is obtained, which is also the weak efficient solution or effective solution of the original vector polynomial optimization problem. Numerical experiments show that the proposed numerical methods are effective.

%U https://zkxb.jsu.edu.cn/EN/10.13438/j.cnki.jdzk.2019.04.003