整数线性规划的基线算法  

The Basic Line Algorithm for Integer Linear Programming

作　　者：卢志义[1] 孟丽丽[1] 韩紫琪 

机构地区：[1]天津商业大学理学院,天津300134

出　　处：《河南科学》2017年第9期1377-1381,共5页Henan Science

基　　金：国家自然科学基金(71371138)

摘　　要：利用基线算法这一解线性规划的新方法,采用等值面下降切割技术和割平面法原理,求解线性整数规划问题.此法集三种技术的优势为一体,对可行域进行不断切割和压缩,快速逼近并获得最优解.最后通过一个实例对所述方法进行了验证.The integer linear programming is solved by the basic line algorithm. In the procedures of this method,the equivalent plane descent cutting method and cutting plane method are used too. The algorithm collects theadvantages of the three methods in itself. Through cutting and reducing the feasible region step by step,itapproaches the optimal solutions rapidly. An example is given.

关 键 词：整数规划 基线算法 等值面 割平面法 

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