Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Ντετερμινιστικός Δυναμικός Προγραμματισμός× | Προγραμματισμός Ακεραίων Τιμών με Ντετερμινιστικές Συνθήκες× | |
|---|---|---|
| Πεδίο | Προσομοίωση | Προσομοίωση |
| Οικογένεια | Process / pipeline | Process / pipeline |
| Έτος προέλευσης≠ | 1957 | 1958 |
| Δημιουργός≠ | Richard E. Bellman | Ralph E. Gomory |
| Τύπος≠ | Exact sequential optimization algorithm | Exact combinatorial optimization |
| Θεμελιώδης πηγή≠ | Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64(5), 275-278. DOI ↗ |
| Εναλλακτικές ονομασίες | DDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic Programming | DIP, Integer Programming, IP, Integer Linear Programming |
| Συναφείς≠ | 6 | 5 |
| Σύνοψη≠ | 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. | Deterministic Integer Programming (DIP) is a mathematical optimization approach that finds the best solution to problems where some or all decision variables must take integer values, given fully known (deterministic) objective and constraint data. It is the classical, non-stochastic form of integer programming, foundational to operations research and combinatorial optimization since the late 1950s. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|