विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| कॉलम जनरेशन (डैन्ट्ज़िग-वोल्फ़)× | सिम्प्लेक्स विधि× | |
|---|---|---|
| क्षेत्र | संचालन अनुसंधान | संचालन अनुसंधान |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1960 | 1947 |
| प्रवर्तक≠ | George B. Dantzig and Philip Wolfe | George Dantzig |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ |
| उपनाम≠ | Dantzig-Wolfe decomposition, column generation method | simplex algorithm |
| संबंधित≠ | 3 | 4 |
| सारांश≠ | 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. | The Simplex Method, developed by George Dantzig in 1947, is a foundational algorithm for solving linear programming problems. It systematically explores vertices of the feasible region to find the optimal solution where the objective function is maximized or minimized subject to linear constraints. |
| ScholarGateडेटासेट ↗ |
|
|