ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Algoritmus Wagnera-Whitina×Bendersova dekompozice×Generování sloupců (Dantzig-Wolfe)×
OborOperační výzkumOperační výzkumOperační výzkum
RodinaMachine learningMachine learningMachine learning
Rok vzniku195819621960
TvůrceHarvey M. Wagner and Thomson M. WhitinJacques F. BendersGeorge B. Dantzig and Philip Wolfe
Typalgorithmalgorithmalgorithm
Původní zdrojWagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5(1), 89-96. DOI ↗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 ↗
Další názvyWagner-Whitin lot-sizing, dynamic lot-sizing algorithmcutting plane method, constraint generationDantzig-Wolfe decomposition, column generation method
Příbuzné333
ShrnutíThe Wagner-Whitin Algorithm, introduced by Harvey M. Wagner and Thomson M. Whitin in 1958, is a dynamic programming solution to the capacitated lot-sizing problem. It determines optimal production quantities over multiple periods to minimize the total cost of production setup and inventory holding while meeting deterministic demand.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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Wagner-Whitin Algorithm · Benders Decomposition · Column Generation (Dantzig-Wolfe). Získáno 2026-06-18 z https://scholargate.app/cs/compare