原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
he dual linear program is always equal to the optimal value of the primal linear program.
We begin by demonstrating weak duality, which states that any feasible solution to the primal linear program has a value no greater than that of any feasible solution to the dual linear program. Lemma 29.1 (Weak linear-programming duality) Let x be any feasible solution to the primal linear program in (29.31)–(29.33), and let ӯ be any feasible solution to
its dual linear program in (29.34)–(29.36). Then Proof We have ▪ Corollary 29.2 Let x be
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea