Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Génération de colonnes (Dantzig-Wolfe)× | Méthode du Simplexe× | |
|---|---|---|
| Domaine | Recherche opérationnelle | Recherche opérationnelle |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1960 | 1947 |
| Auteur d'origine≠ | George B. Dantzig and Philip Wolfe | George Dantzig |
| Type | algorithm | algorithm |
| Source fondatrice≠ | 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 ↗ |
| Alias≠ | Dantzig-Wolfe decomposition, column generation method | simplex algorithm |
| Apparentées≠ | 3 | 4 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|