Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Deterministisk heltalsoptimering× | Dynamisk programmering× | |
|---|---|---|
| Ämnesområde≠ | Simulering | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1958 | 1957 |
| Upphovsperson≠ | Ralph E. Gomory | Richard Bellman |
| Typ≠ | Exact combinatorial optimization | Exact combinatorial optimization via recursive decomposition |
| Ursprungskälla≠ | 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 ↗ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 |
| Alias | DIP, Integer Programming, IP, Integer Linear Programming | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama |
| Närliggande≠ | 5 | 3 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|