Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Geração de Colunas (Dantzig-Wolfe)× | Método Simplex× | |
|---|---|---|
| Área | Pesquisa operacional | Pesquisa operacional |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1960 | 1947 |
| Autor original≠ | George B. Dantzig and Philip Wolfe | George Dantzig |
| Tipo | algorithm | algorithm |
| Fonte seminal≠ | Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ |
| Outros nomes≠ | Dantzig-Wolfe decomposition, column generation method | simplex algorithm |
| Relacionados≠ | 3 | 4 |
| Resumo≠ | 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. | 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. |
| ScholarGateConjunto de dados ↗ |
|
|