原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
3), and let ӯ be a feasible solution to the dual linear program given in (29.34)–(29.36).
Complementary slackness states that the following conditions are necessary and sufficient for x and ӯ to be optimal: and a. Verify that complementary slackness holds for the linear program in lines (29.37)–(29.41). b. Prove that complementary slackness holds for any primal linear program and its corresponding dual.
c. Prove that a feasible solution x to a primal linear program given in lines (29.31)–(29
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea