Showing 1 - 1 of 1
In this paper we present necessary conditions for global optimality for polynomial problems with box or bivalent constraints using separable polynomial relaxations. We achieve this by first deriving a numerically checkable characterization of global optimality for separable polynomial problems...
Persistent link: https://www.econbiz.de/10010758665