Exploiting Equalities in Polynomial Programming

We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the, typically simpler, problem without equalities can be used to address the problem with equalities. In particular, we propose new solution schemes for mixed binary programs, pure 0–1 quadratic programs, and the stable set problem.