原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
imal objective value, then the feasible region is unbounded and so is the linear program.
Exercise 29.1-5 asks you to show that a linear program can have a finite optimal objective value even if the feasible region is unbounded. One of the reasons for the power and popularity of linear programming is that linear programs can, in general, be solved
efficiently. There are two classes of algorithms, known as ellipsoid algorithms and inter
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea