Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Метод ветвления и отсечения Бендерса× | Генерация столбцов (Данциг-Вольф)× | Метод симплекс× | |
|---|---|---|---|
| Область | Исследование операций | Исследование операций | Исследование операций |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 1962 | 1960 | 1947 |
| Автор метода≠ | Jacques F. Benders | George B. Dantzig and Philip Wolfe | George Dantzig |
| Тип | algorithm | algorithm | algorithm |
| Основополагающий источник≠ | Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252. DOI ↗ | 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 ↗ |
| Другие названия≠ | cutting plane method, constraint generation | Dantzig-Wolfe decomposition, column generation method | simplex algorithm |
| Связанные≠ | 3 | 3 | 4 |
| Сводка≠ | Benders Decomposition, introduced by Jacques F. Benders in 1962, is a powerful algorithmic framework for solving large-scale mixed-integer programming (MIP) problems. It decomposes the problem into a master problem (controlling complicating variables) and subproblems (handling remaining variables), using cutting planes generated from subproblem dual information to iteratively tighten the master problem. | 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. |
| ScholarGateНабор данных ↗ |
|
|
|