Process / pipeline
线性规划 — 线性目标在约束下的最优化
线性规划（LP）由乔治·B·丹齐格（George B. Dantzig）于1947年开创，是一种数学方法，用于在满足一组线性的不等式和等式约束的条件下，找到线性目标函数（如最低成本或最高利润）的最佳值。它是运筹学的基本技术，是生产计划、资源分配、物流、饮食问题以及工程、经济学和自然科学中无数其他决策场景的基础。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
+1 more
来源
- Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136
- Vanderbei, R.J. (2014). Linear Programming: Foundations and Extensions. Springer. DOI: 10.1007/978-1-4614-7630-6 ↗
如何引用本页
ScholarGate. (2026, June 1). Linear Programming (LP). ScholarGate. https://scholargate.app/zh/optimization/linear-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →