Tighter bound functions for nonconvex functions over simplexes

Abstract

In this paper, we propose new lower and upper bound functions which can be used in computing a range of nonconvex functions over simplexes of Rn, or for solving global optimization problems over simplexes. We show that the new bounding functions are tighter than the classical bounding functions developed in the αBB method and the QBB method.