Krahasoni metodat

	Gjenerimi i Kolonave (Dantzig-Wolfe)	Dekompozimi i Bendersit
Fusha	Kërkimi operacional	Kërkimi operacional
Familja	Machine learning	Machine learning
Viti i origjinës	1960	1962
Krijuesi	George B. Dantzig and Philip Wolfe	Jacques F. Benders
Lloji	algorithm	algorithm
Burimi themelues	Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111.	Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252.
Emërtime të tjera	Dantzig-Wolfe decomposition, column generation method	cutting plane method, constraint generation
Të lidhura	3	3
Përmbledhja	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.	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.