方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 单纯形法× | 列生成算法 (Dantzig-Wolfe)× | |
|---|---|---|
| 领域 | 运筹学 | 运筹学 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1947 | 1960 |
| 提出者≠ | George Dantzig | George B. Dantzig and Philip Wolfe |
| 类型 | algorithm | algorithm |
| 开创性文献≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ | Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗ |
| 别名≠ | simplex algorithm | Dantzig-Wolfe decomposition, column generation method |
| 相关≠ | 4 | 3 |
| 摘要≠ | The Simplex Method, developed by George Dantzig in 1947, is a foundational algorithm for solving linear programming problems. It systematically explores vertices of the feasible region to find the optimal solution where the objective function is maximized or minimized subject to linear constraints. | Column Generation, developed by George B. Dantzig and Philip Wolfe in 1960, is a powerful optimization technique for solving large-scale linear programming problems with special structure. Also known as Dantzig-Wolfe Decomposition, it decomposes the problem into a master problem (restricted to a subset of variables/columns) and a pricing subproblem (identifying new variables), iteratively improving the solution by introducing only relevant columns. |
| ScholarGate数据集 ↗ |
|
|