摘要
借鉴求解整数线性规划分支定界法的思路,通过构造与其对应线性规划最优解的等值线平行的过滤条件,使其整数线性规划的可行域变小,只从局部可行域上通过枚举找出整数线性规划的最优解.
Reference to integer programming branch and bound method, by constructing the filter conditions of parallel to the contour of the optimal solution of the corresponding linear programming, so the feasible region of integer linear programming is smaller, and find the optimal solution of integer linear programming by enumeration only from the local feasible region.
出处
《甘肃高师学报》
2017年第6期4-6,共3页
Journal of Gansu Normal Colleges
关键词
整数规划
线性规划
单纯形法
最优解
等值线
integer programming
linear programming
simplex method
optimal solution
contour method
