原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
There exists w ∈ ℝm+1 such that w ≥ 0, wTM = 0 (an n-vector of all zeros), and wTg < 0. ▪
Theorem 29.4 (Linear-programming duality) Given the primal linear program in (29.31)–(29.33) and its corresponding dual in (29.34)–(29.36), if both are feasible and bounded, then for optimal solutions x* and y*, we have cTx* = bTy*. Proof Let μ = bTy* be the optimal value of the dual
linear program given in (29.34)–(29.36). Consider an augmented set of primal constraints
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea