其中最重要的是纯整数线性规划问题
吕永鹏
解纯整数规划的割平面法解释[EB/OL]
北京：中国科技论文在线
则称该整数线性规划为整数线性规划
若松弛问题是一个线性规划
由余下的目标函数和约束条件够成的规划问题称为整数规划的松弛问题
） 摘要： 要求一部分或全部决策变量必须取整数值的规划问题称为整数规划
） Abstract： The requested part or all of the decision variables must take integer values is called integer programming planning
Without considering the conditions integers, from remaining objective function and constraints sufficiently into the planning of the relaxation is called integer programming problems
If the problem is a linear programming relaxation, claimed that the integer linear programming for the integer linear programming
One of the most important thing is a pure integer linear programming problem
It is to understand the basis for other integer programming problem
Keywords： Integer;cutting plane;the optimal solution;simplex method 下载PDF阅读器 PDF全文下载： 初稿 （ 160 ） 作者简介： 通信联系人： 【收录情况】 中国科技论文在线： 李新宏
