原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
the inequalities f(x1, x2, … , xn) ≤ b and f(x1, x2, … , xn) ≥ b are linear inequalities.
We use the general term linear constraints to denote either linear equalities or linear inequalities. Linear programming does not allow strict inequalities. Formally, a linear-programming problem is the problem of either minimizing or maximizing a linear function subject to a finite set of linear
constraints. If minimizing, we call the linear program a minimization linear program, and
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea