知识卡片

普通读书笔记卡 · 3658.b.4

整数约束改变线性规划难度

理解等级:中级

在线性规划上再要求所有变量取整数,得到整数线性规划。

书中指出仅寻找一个可行整数解就可为NP难;连续变量线性规划能在多项式时间求解,不能把这一保证直接套到整数版本。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第29章 线性规划 · 查看原书依据

      If you add to a linear program the additional requirement that all variables take on integer values, you have an integer linear program. Exercise 34.5-3 on page 1098 asks you to show that just finding a feasible solution to this problem is NP-hard. Since no polynomial-time algorithms are known for any NP-hard problems, there is no known polynomial-time algorithm for integer linear programming.

    参考来源

    - 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[15000,20000))。 - 结论依据:原文说明单纯形、整数规划及网络优化模型的变量、约束与目标;对应图和公式已核对。 - 原始内容:If you add to a linear program the additional requirement that all variables take on integer values, you have an integer linear program . Exercise 34.5-3 on page 1098 asks you to show that just finding a feasible solution to this problem is NP-hard. Since no polynomial-time algorithms are known for any NP-hard problems, there is no known polynomial-time algorithm for integer linear programming.