In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is fraction convex and concave polynomial, constraints consist infinitely many inequalities. To solve such problem, first reformulate it to pair primal dual conic optimization reduce semidefinite (SDP) problems if can bring sum-of-squares structures into constraints. end, ...