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 heuristic implicit enumeration presented in this thesis can effectively solve this kind of problems. It is different from other algorithms, such as simplex, cutting plane method, etc.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
The heuristic implicit enumeration presented in this thesis can effectively solve this kind of problems. It is different from other algorithms, such as simplex, cutting plane method, etc.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
应用推荐