global optimality for separable polynomial problems with box as well as bivalent constraints. Our necessary optimality … with box or bivalent constraints. We construct underestimators using the sum of squares convex (SOS-convex) polynomials of …In this paper we present necessary conditions for global optimality for polynomial problems with box or bivalent …