Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Simplexová metoda× | Generování sloupců (Dantzig-Wolfe)× | |
|---|---|---|
| Obor | Operační výzkum | Operační výzkum |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1947 | 1960 |
| Tvůrce≠ | George Dantzig | George B. Dantzig and Philip Wolfe |
| Typ | algorithm | algorithm |
| Původní zdroj≠ | 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 ↗ |
| Další názvy≠ | simplex algorithm | Dantzig-Wolfe decomposition, column generation method |
| Příbuzné≠ | 4 | 3 |
| Shrnutí≠ | 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. |
| ScholarGateDatová sada ↗ |
|
|