知识卡片

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

多项式规模建模保留求解效率

理解等级:中级

把问题写成相对于输入规模为多项式大小的线性规划,就可用椭球法或内点法在多项式时间求解。

建模时不仅要验证目标与约束线性,还要数清变量、约束和编码规模。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      Perhaps the most important aspect of linear programming is to be able to recognize when you can formulate a problem as a linear program. Once you cast a problem as a polynomial-sized linear program, you can solve it in polynomial time by the ellipsoid algorithm or interior-point methods. Several linear-programming software

    参考来源

    - 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[20000,25000))。 - 结论依据:原文说明单纯形、整数规划及网络优化模型的变量、约束与目标;对应图和公式已核对。 - 原始内容:Perhaps the most important aspect of linear programming is to be able to recognize when you can formulate a problem as a linear program. Once you cast a problem as a polynomial-sized linear program, you can solve it in polynomial time by the ellipsoid algorithm or interior-point methods. Several linear-programming software