原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
ity of linear programming is that linear programs can, in general, be solved efficiently.
There are two classes of algorithms, known as ellipsoid algorithms and interior-point algorithms, that solve linear programs in polynomial time. In addition, the simplex algorithm is widely used. Although it does not run in polynomial time in the worst case, it tends to perform well in practice. We will not give a detailed algorithm for
linear programming, but will discuss a few important ideas. First, we will give an exampl
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea