विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| निश्चित मिश्र-पूर्णांक प्रोग्रामिंग× | नियतात्मक गतिक प्रोग्रामन× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1958–1960 | 1957 |
| प्रवर्तक≠ | Gomory, R. E.; Dantzig, G. B.; Land, A. H.; Doig, A. G. | Richard E. Bellman |
| प्रकार≠ | Mathematical programming / combinatorial optimization | Exact sequential optimization algorithm |
| मौलिक स्रोत≠ | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York. ISBN: 9780471359432 | Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 |
| उपनाम | Deterministic MIP, Deterministic MILP/MIQP, Classical Mixed-Integer Programming, Deterministic MIP Optimization | DDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic Programming |
| संबंधित | 6 | 6 |
| सारांश≠ | Deterministic Mixed-Integer Programming (MIP) is a mathematical optimization framework that finds the provably optimal solution to problems involving both continuous and integer decision variables under fully known, fixed coefficients and constraints. It is the foundational workhorse of operations research when all data are treated as certain. | Deterministic Dynamic Programming (DDP) is a mathematical optimization technique that decomposes a multi-stage decision problem into a sequence of simpler subproblems, solving them exactly when all system parameters — transition functions, costs, and rewards — are known with certainty. It guarantees a globally optimal policy via Bellman's principle of optimality. |
| ScholarGateडेटासेट ↗ |
|
|