← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

29 第29章 线性规划

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

d in inequality (29.16), x ≥ 0 means that each entry of the vector x must be nonnegative.

We call this representation the standard form for a linear program, and we adopt the convention that A, b, and c always have the dimensions given above. The standard form above may not naturally correspond to real-life situations you are trying to model.

For example, you might have equality constraints or variables that can take on negative v

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea