求解整数线性规划的一种等值线法  

A Contour Method for Solving Integer Linear Programming

作　　者：温大伟[1] 陈莉[1] 谢文环 

机构地区：[1]兰州城市学院数学学院,甘肃兰州730070 [2]兰州工业学院公寓管理中心,甘肃兰州730050

出　　处：《甘肃高师学报》2017年第6期4-6,共3页Journal of Gansu Normal Colleges

摘　　要：借鉴求解整数线性规划分支定界法的思路,通过构造与其对应线性规划最优解的等值线平行的过滤条件,使其整数线性规划的可行域变小,只从局部可行域上通过枚举找出整数线性规划的最优解.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.

关 键 词：整数规划 线性规划 单纯形法 最优解 等值线 

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