विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| फोर्ड-फल्करसन एल्गोरिथम× | सिम्प्लेक्स विधि× | |
|---|---|---|
| क्षेत्र | संचालन अनुसंधान | संचालन अनुसंधान |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1956 | 1947 |
| प्रवर्तक≠ | Lester R. Ford and Delbert R. Fulkerson | George Dantzig |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ |
| उपनाम≠ | Ford-Fulkerson method, augmenting path method | simplex algorithm |
| संबंधित | 4 | 4 |
| सारांश≠ | The Ford-Fulkerson Algorithm, developed by Lester R. Ford and Delbert R. Fulkerson in 1956, is a foundational method for computing the maximum flow in a flow network. It finds the maximum amount of flow that can be sent from a source to a sink through a directed graph with capacity constraints on edges. | 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डेटासेट ↗ |
|
|