DividePlane

代码说明：

  用割平面法求解整数规划。先不考虑整数约束条件，求松弛问题的最优解，如果获得整数最优解，即为所求，运算停止．如果所得到最优解不满足整数约束条件，则在此非整数解的基础上增加新的约束条件重新求解．(By cutting plane method for solving integer programming. Not considered integer constraints, the optimal solution relaxation problem, if the integer obtained optimal solution is sought, and operation stops. If the optimal solution does not satisfy the integer constraints, then on the basis of this non-integer solutions adding new constraints on the re-solving.)