根据问题的最优性和可行性提出一新的区域删除准则以排除问题(P)的可行域中不存在全局最优解的部分,结合区域删除准则和分支定界理论给出新算法.数值算例表明算法是有效可行的.
New region-deleting principles are proposed based on the optimality and feasibility of the problem so as to delete the subregion without containing the optimal solutions of the problem (P). The new algorithm is proposed by combining the region-deleting principles with branch and bound theories. The numerical examples show the algorithm is feasible and effective.