原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
e primal linear program is a maximization problem and the dual is a minimization problem.
Thus, if feasible solutions x and ӯ have the same objective value, neither can be improved. ▪ We now show that, at optimality, the primal and dual objective values are indeed equal. To prove linear programming duality, we will require one lemma from linear algebra, known as Farkas’s lemma, the
proof of which Problem 29-4 asks you to provide. Farkas’s lemma can take several forms, e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea