原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
29.3 Duality We will now introduce a powerful concept called linear-programming duality.
In general, given a maximization problem, duality allows you to formulate a related minimization problem that has the same objective value. The idea of duality is actually more general than linear programming, but we restrict our attention to linear programming in this section. Duality enables us to prove that a solution is indeed optimal. We saw
an example of duality in Chapter 24 with Theorem 24.6, the max-flow min-cut theorem. Supp
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea