Machine learningOptimization
单纯形法
单纯形法由乔治·丹齐格于1947年开发，是求解线性规划问题的基础算法。它系统地探索可行域的顶点，以在满足线性约束的条件下找到目标函数最大化或最小化的最优解。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI: 10.1515/9781400884179 ↗
- Vanderbei, R. J. (2014). Linear Programming: Foundations and Extensions (4th ed.). Springer. DOI: 10.1007/978-1-4614-7630-6 ↗
如何引用本页
ScholarGate. (2026, June 3). The Simplex Method for Linear Programming. ScholarGate. https://scholargate.app/zh/operations-research/simplex-method
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
- Benders Decomposition运筹学↔ compare
- 列生成算法 (Dantzig-Wolfe)运筹学↔ compare
- 迪杰斯特拉算法运筹学↔ compare