原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
. The optimal solution to the linear program is x1 = 2 and x2 = 6 with objective value 8.
It is no accident that an optimal solution to the linear program occurs at a vertex of the feasible region. The maximum value of z for which the line x1 + x2 = z intersects the feasible region must be on the boundary of the feasible region, and thus the intersection of this line with the boundary of the feasible region is either a single vertex or a line segment. If the intersection is a single vertex, then there is just
one optimal solution, and it is that vertex. If the intersection is a line segment, every
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea