A Global Optimization Algorithm for Non-Convex Mixed-Integer Problems
In the present paper, the mixed-integer global optimization problems are considered. A novel deterministic algorithm for solving the problems of this class based on the information-statistical approach to solving the continuous global optimization problems has been proposed. The comparison of this algorithm with known analogs demonstrating the efficiency of the developed approach has been conducted. The stable operation of the algorithm was confirmed also by solving a series of several hundred mixed-integer global optimization problems.
KeywordsGlobal optimization Non-convex constraints Mixed-integer problems
This study was supported by the Russian Science Foundation, project No 16-11-10150.