原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
r setting of the values in a variable, say x, by putting a bar over the variable name: x.
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
cTx the optimal objective value. If a linear program has no feasible solutions, we say th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea