Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Ο Αλγόριθμος Wagner-Whitin× | Μέθοδος Simplex× | |
|---|---|---|
| Πεδίο | Επιχειρησιακή Έρευνα | Επιχειρησιακή Έρευνα |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 1958 | 1947 |
| Δημιουργός≠ | Harvey M. Wagner and Thomson M. Whitin | George Dantzig |
| Τύπος | 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. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ |
| Εναλλακτικές ονομασίες≠ | Wagner-Whitin lot-sizing, dynamic lot-sizing algorithm | simplex algorithm |
| Συναφείς≠ | 3 | 4 |
| Σύνοψη≠ | 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. | 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Σύνολο δεδομένων ↗ |
|
|