知识卡片
单纯形法沿顶点边逐步改进
单纯形法从可行域顶点出发,每步沿边移到目标值不下降的邻接顶点。
线性目标与凸可行域使局部最优可成为全局最优;这种顶点路径直觉不等于多项式最坏时间保证。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第29章 线性规划 · 查看原书依据
The simplex algorithm takes as input a linear program and returns an optimal solution. It starts at some vertex of the simplex and performs a sequence of iterations. In each iteration, it moves along an edge of the simplex from a current vertex to a neighboring vertex whose objective value is no smaller than that of the current vertex (and usually is larger.) The
参考来源
- 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[15000,20000))。
- 结论依据:原文说明单纯形、整数规划及网络优化模型的变量、约束与目标;对应图和公式已核对。
- 原始内容:The simplex algorithm takes as input a linear program and returns an optimal solution. It starts at some vertex of the simplex and performs a sequence of iterations. In each iteration, it moves along an edge of the simplex from a current vertex to a neighboring vertex whose objective value is no smaller than that of the current vertex (and usually is larger.) The