Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Simplexmetoden× | Kolumngenerering (Dantzig-Wolfe)× | |
|---|---|---|
| Ämnesområde | Operationsanalys | Operationsanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1947 | 1960 |
| Upphovsperson≠ | George Dantzig | George B. Dantzig and Philip Wolfe |
| Typ | algorithm | algorithm |
| Ursprungskälla≠ | 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 ↗ |
| Alias≠ | simplex algorithm | Dantzig-Wolfe decomposition, column generation method |
| Närliggande≠ | 4 | 3 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|