知识卡片
可行解须满足全部约束
一个变量赋值只有满足全部约束才是可行解;违反任何一条便不可行。
可行解集合构成可行域;其中目标值在全部可行解中达到最大值的才是最大化问题的最优解。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第29章 线性规划 · 查看原书依据
If x satisfies all the constraints, then it is a feasible solution, but if it fails to satisfy at least one constraint, then it is an infeasible solution. We say that a solution x has objective value cTx. A feasible solution x whose objective value is maximum over all feasible solutions is an optimal solution, and we call its objective value
参考来源
- 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[5000,10000))。
- 结论依据:原文对线性规划建模、标准形式、可行性与几何性质的论述;对应公式图已核对。
- 原始内容:If x satisfies all the constraints, then it is a feasible solution , but if it fails to satisfy at least one constraint, then it is an infeasible solution . We say that a solution x has objective value c T x . A feasible solution x whose objective value is maximum over all feasible solutions is an optimal solution , and we call its objective value