原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
ear program the primal. Given the primal linear program subject to its dual is subject to
Mechanically, to form the dual, change the maximization to a minimization, exchange the roles of coefficients on the right-hand sides and in the objective function, and replace each ≤ by ≥. Each of the m constraints in the primal corresponds to a variable yi in the dual.
Likewise, each of the n constraints in the dual corresponds to a variable xj in the prima
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea