ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Wagner-Whitinov algoritam×Generisanje kolona (Dantzig-Wolfe)×
OblastOperaciona istraživanjaOperaciona istraživanja
PorodicaMachine learningMachine learning
Godina nastanka19581960
TvoracHarvey M. Wagner and Thomson M. WhitinGeorge B. Dantzig and Philip Wolfe
Tipalgorithmalgorithm
Temeljni izvorWagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5(1), 89-96. DOI ↗Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗
Drugi naziviWagner-Whitin lot-sizing, dynamic lot-sizing algorithmDantzig-Wolfe decomposition, column generation method
Srodne33
SažetakThe 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.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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Wagner-Whitin Algorithm · Column Generation (Dantzig-Wolfe). Preuzeto 2026-06-17 sa https://scholargate.app/sr/compare