Linear programming relaxation
- 线性规划的松弛（0-1整数规划的线性规划松弛是把每个变量必须为0或1的约束替换为每个变量属于[0,1]的约束。这种松弛技术把NP难的最优化问题转化为多项式时间可解的问题。松弛后的线性规划的解可以获得原整数规划的解的信息）
网络释义英英释义
短语
Linear programming relaxation
- abstract: In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1].
以上来源于: WordNet
应用推荐
$firstVoiceSent
- 来自原声例句