विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| Dynamic Programming× | लक्ष्य प्रोग्रामिंग× | |
|---|---|---|
| क्षेत्र≠ | अनुकूलन | निर्णयन |
| परिवार≠ | Process / pipeline | MCDM |
| उद्भव वर्ष≠ | 1957 | 1955 |
| प्रवर्तक≠ | Richard Bellman | Charnes, A., Cooper, W. W. |
| प्रकार≠ | Exact combinatorial optimization via recursive decomposition | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation |
| मौलिक स्रोत≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ |
| उपनाम≠ | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama | — |
| संबंधित≠ | 3 | 8 |
| सारांश≠ | Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure. | GOAL-PROGRAMMING (Goal Programming — Minimise deviations from multiple aspiration levels) is a ranking multi-criteria decision-making (MCDM) method introduced by Charnes, A., Cooper, W. W. in 1955. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. |
| ScholarGateडेटासेट ↗ |
|
|