整数线性规划的一种新的割平面法  

A NEW CUTTING PLANE METHOD FOR INTERGER LINEAR PROGRAMMING

作　　者：高培旺[1] 高培生 

机构地区：[1]中南大学铁道校区数理力学系,长沙410075 [2]湖南省农业银行,长沙410007

出　　处：《经济数学》2001年第1期46-51,共6页Journal of Quantitative Economics

摘　　要：本文提出了一种新的求解整数线性规划的割平面思路 .它利用目标函数等值面的移动来切割与(IL P)相应的 (SL P)可行域的“无用”部分 ,再通过扩大与 (SL P)最优基相应的非基变量的取值来压缩 (SL P)的可行域 ,由此求得整数线性规划的最优解 .This paper presents a new cutting plane thought,which “insignificant” parts of the feasible domain of (SLP) associated with (ILP) would be cut off by controlling the decrease of the optimal objective value of the (SLP) and be shrunken off by augmenting the values of the nonbasic varables associated with the optimal basis of the (SLP).If any,optimal solutions of integer linear programming problem would be obtained by the method.

关 键 词：整数线性规划 单纯形法 割平面法 目标函数 等值面 最优基 非基变量 最优解 

分 类 号：O221.4[理学—运筹学与控制论]