The bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems

Abstract

In this work a Bernstein global optimization algorithm to solve unconstrained polynomial mixed-integer nonlinear programming (MINLP) problems is proposed. The proposed algorithm use a branchand-bound framework and possesses several new features, such as a modified subdivision procedure, the Bernstein box consistency and the Bernstein hull consistency procedures to prune the solution search space. The performance of the proposed algorithm is numerically investigated and compared with previously reported Bernstein global optimization algorithm on a set of 10 test problems. The findings of the tests establishes the efficacy of the proposed algorithm over the previously reported Bernstein algorithm in terms of the chosen performance metrics.