New Relaxation Schemes for Polynomial Programing

We present a new representation theorem for positiveness of polynomials with degree bounds. This new result has a elementary proof, and interesting consequences for polynomial programing (PP). In particular we present how to exploit this theorem to obtain cheaper relaxations for PPs.