← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

29 第29章 线性规划

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.755Z

tion. In stating the lemma, we use m + 1 as a dimension because it matches our use below.

Lemma 29.3 (Farkas’s lemma) Given M ∈ ℝ(m+1)×n and g ∈ ℝm+1, exactly one of the following statements is true: There exists v ∈ ℝn such that Mv ≤ g, 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)–(2

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea