In this paper, the Active Set cuttingplanemethod for integer programming is derived from Active Set method of linear programming.
探讨了用线性规划的有效集法求解整数规划问题，称之为有效集割平面法。
2
Moreover, a cuttingplanemethod of interactive linear multiple object decision which is more practical for decision process is used to solve the model.
利用更接近于实际决策过程的交互式线性多目标决策的割平面法对模型求解，给出了计算实例与分析。
3
The heuristic implicit enumeration presented in this thesis can effectively solve this kind of problems. It is different from other algorithms, such as simplex, cuttingplanemethod, etc.