割平面法

解ILP的割平面法的收敛性问题

On the Problems of Astringency of Cutting Plane Method Used in Resolving ILP

提出了一种采用内点割平面法求解混合整数最优潮流（OPF）的算法。

A new algorithm is presented in this paper to solve Mixed Integer Optimal Power Flow ( OPF ) problem by Interior Point Cutting Plane Method ( IPCPM ) .

把目标等值面切割定界原理与Gomory的割平面法结合起来求解整数线性规划（ILP）问题。

This paper combines a cutting_and_bound principle of objective equivalent plane with the Gomory cutting plane method for solving integer linear programming problems .

基于内点割平面法的混合整数最优潮流算法

Mixed integer optimal power flow based on interior point cutting plane method

一种基于解析中心割平面法的分类算法

A Classification Algorithm Based on Analytic Center Cutting Plane Method

本文运用内点割平面法来求解此类问题。

The interior point cutting plane method is used to solve this problem .

整数规划的有效集割平面法

The Active Set Cutting Plane Method for Integer Programming

解多目标最优化问题的权衡割平面法

An Interactive Tradeoff Cutting-Plane Algorithm for Multiobjective Optimization

线性多目标决策的割平面法

Cutting Plane Method for Linear Multiple Objective Decision

非线性规划的内割平面法

Interior cutting plane method for nonlinear programming

割平面法的改进

An improving of cutting plane method

目标等值面切割定界与割平面法结合求解整数规划

Combining Cutting-and-bound Principle of Objective Equivalent Plane with the Cutting Plane Method for Solving Integer Linear Programming

这种新解法命名为松驰最优解邻域整点搜索法，属于常规解法，但在简捷高效方面，远胜过现有的两种常规解法&分枝定界法和割平面法。

This method was more shortcut and efficient than present two regular methods & Brach-bound and cutting plane .

目标收敛法还可与割平面法、分枝估界等方法结合起来使用，从而加速求解过程。

Also , the method can be combined well with branch and bound method and cutting plane approach to accelerate the solving process .

探讨了用线性规划的有效集法求解整数规划问题，称之为有效集割平面法。

In this paper , the Active Set cutting plane method for integer programming is derived from Active Set method of linear programming .

利用更接近于实际决策过程的交互式线性多目标决策的割平面法对模型求解，给出了计算实例与分析。

Moreover , a cutting plane method of interactive linear multiple object decision which is more practical for decision process is used to solve the model .

传统的代理约束方法虽可加速分支定界法或割平面法的求解速度，但往往会扩大原问题的可行域，不能保证得到原问题的最优解。

The conventional surrogate constraint method , which can improve the efficiency of branch-and-bound or cutting plane algorithms , can not guarantee to find the optimal solution of the primal problem .

本文是将分支定界法与改进的割平面法、隐枚举法相结合，提出一种解决整数线性规划的混合型方法。

The article proposes a mixed algorithm for solving integral linear programming . In the algorithm the Branch-and-Bound Method is combined with the improving cutting-plane method and the implicit enumeration method .

与单纯形割平面法相比，内点割平面法不仅简单易实现，计算效率高，而且随着问题规模的增加，更能发挥其多项式时间特性的优点。

Compared with Simplex Cutting Plane Method ( SCPM ) IPCPM is simpler and during the scale of system becoming larger and larger it is more efficient because of its polynomial-time characteristic .

其综合了分枝定界法与割平面法，减少了分枝次数，简化了割平面的技巧。

The basic ideas of the algorithm is due to concentrating of the brance-bound and the cutting-plane , but it decreases the number of the branch and simplifies the technique of the cutting-plane .

整数规划是规划论中较新的一个分枝，它是研究决策变量取整数的一类线性规划，主要的解法有割平面法和分枝定界法两种。

Integer plan is a relatively new branch of planning theory , a first-class linear plan researching decisive variables relying on integer . It has two main solutions : plane-cutting and branch delimitation .