说明：  割平面法主要用于求解整数规划问题的方法。1958年由美国格莫理提出。基本思路是：先不考虑整数性约束，求解相应的线性规划问题。若线性规划问题的最优解恰好是整数解，则此解即为整数规划问题的最优解。否则，就增加一个新的约束条件,称为割平面。割平面必须具有两条性质：（1)从线性规划问题的可行域中至少割掉目前的非整数最优解；（2)不割掉任何整数可行域，然后在缩小的可行域上继续解线性规划问题。重复以上做法，经有限次切割后，必可在缩小的可行域的一个整数极点上达到整数规划问题的最优解。
(Cut plane method is mainly used to solve integer programming problems. In 1958, it was proposed by American Gemory. The basic idea is to solve the corresponding linear programming problem without considering integer constraints. If the optimal solution of the linear programming problem is exactly an integer solution, then the solution is the optimal solution of the integer programming problem. Otherwise, a new constraint condition is added, which is called the cut plane. Cut planes must have two properties: (1) cut off at least the current non-integer optimal solution from the feasible region of linear programming problems; (2) do not cut off any integer feasible region, and then continue to solve linear programming problems on the reduced feasible region. By repeating the above method, the optimal solution of the integer programming problem can be obtained at an integer pole of the reduced feasible domain after finite cuts.)