An integral global optimization algorithm for mixed programming problem

摘要

An integral approach for finding global minimizer of mixed programming problem is proposed. Towards this goal, a Q-measure space is preliminarily constructed. Some properties of the method are examined in this paper. Furthermore, optimality conditions and algorithm are given. And some numerical tests are reported to show the the feasibility of the method.