ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Генерация столбцов (Данциг-Вольф)×Метод дополненного Лагранжиана×Метод симплекс×
ОбластьИсследование операцийИсследование операцийИсследование операций
СемействоMachine learningMachine learningMachine learning
Год появления196019691947
Автор методаGeorge B. Dantzig and Philip WolfeMagnus R. Hestenes and M. J. D. PowellGeorge Dantzig
Типalgorithmalgorithmalgorithm
Основополагающий источникDantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗Hestenes, M. R. (1969). Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4(5), 303-320. DOI ↗Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗
Другие названияDantzig-Wolfe decomposition, column generation methodmethod of multipliers, augmented Lagrangian, ADMMsimplex algorithm
Связанные334
Сводка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 Augmented Lagrangian Method, developed by Magnus R. Hestenes and M. J. D. Powell in 1969, is a powerful technique for solving constrained optimization problems. It converts a constrained problem into a sequence of unconstrained subproblems by augmenting the Lagrangian with a quadratic penalty term, enabling efficient solution of large-scale problems including convex and nonconvex cases.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Набор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 3 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Column Generation (Dantzig-Wolfe) · Augmented Lagrangian Method · Simplex Method. Получено 2026-06-17 из https://scholargate.app/ru/compare