混合整数典范DC规划问题的分支定界算法

Mixed Integer Model for DC Programming Problem of Branch and Bound Algorithm

针对一类混合整数典范DC规划问题,提出了一个基于切平面的分支定界缩减方法.该方法用约束条件的切平面将可行域线性化,并使用了二分规则.数值结果表明所提出的算法是可行的,可以求解大规模问题.

Based on a class of mixed integer model for DC programming problems,puts forward a new branch and bound method. In this method,the constraint function is used to be linear and we also use binary rules. Numerical results show that the proposed algorithm is feasible and large-scale problems can be solved.