विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| वैग्नर-व्हिटिन एल्गोरिथम× | कॉलम जनरेशन (डैन्ट्ज़िग-वोल्फ़)× | |
|---|---|---|
| क्षेत्र | संचालन अनुसंधान | संचालन अनुसंधान |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1958 | 1960 |
| प्रवर्तक≠ | Harvey M. Wagner and Thomson M. Whitin | George B. Dantzig and Philip Wolfe |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Wagner, 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 ↗ |
| उपनाम | Wagner-Whitin lot-sizing, dynamic lot-sizing algorithm | Dantzig-Wolfe decomposition, column generation method |
| संबंधित | 3 | 3 |
| सारांश≠ | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|