Sammenlign metoder

	Benders-dekomponering	Augmenteret Lagrange-metode	Kolonnegenerering (Dantzig-Wolfe)
Fagområde	Operationsanalyse	Operationsanalyse	Operationsanalyse
Familie	Machine learning	Machine learning	Machine learning
Oprindelsesår	1962	1969	1960
Ophavsperson	Jacques F. Benders	Magnus R. Hestenes and M. J. D. Powell	George B. Dantzig and Philip Wolfe
Type	algorithm	algorithm	algorithm
Oprindelig kilde	Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252.	Hestenes, M. R. (1969). Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4(5), 303-320.	Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111.
Aliasser	cutting plane method, constraint generation	method of multipliers, augmented Lagrangian, ADMM	Dantzig-Wolfe decomposition, column generation method
Relaterede	3	3	3
Resumé	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.	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.	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.