摘要
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的,嵌入分支定界法可以提供好的界。
In this paper,a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
关键词
混合整数规划
代理约束
线性规划
mixed integer programming
surrogate constraint
linear programming
