Résumé
In deterministic constrained global optimization, upper bounding the objective function generally resorts to local minimization at the nodes of the branch and bound. The local minimization process is sometimes costly when constraints must be respected. We propose in this paper an alternative approach when the constraints are inequalities or relaxed equalities so that the feasible space has a non-null volume. First, we extract an inner region, i.e., an (entirely feasible) convex polyhedron or box in which all points satisfy the constraints. Second, we select a point inside the extracted inner region and update the upper bound with its cost. We use two inner region extraction algorithms implemented in our interval B&B called IbexOpt [7]. This upper bounding shows good performance in medium-sized systems proposed in the COCONUT suite.