Dynamic ProgrammingCRC Press, 31. okt. 1991 - 432 strani Portrays dynamic programming as a methodology, identifying its constituent components, and explaining how it approaches problems and tackles them. Does not consider it as a practical tool, nor how it might address any actual situations in the real world. Assumes calculus, set theory, and some optimi |
Vsebina
Preface | 1 |
Fundamentals | 7 |
Multistage Decision Model | 30 |
Dynamic Programming An Outline 55 | 55 |
Solving the Functional Equation | 82 |
Successive Approximations Method | 108 |
Optimal Policies | 150 |
The Curse of Dimensionality | 174 |
The State | 232 |
Parametric Schemes | 258 |
The Principle of Optimality | 283 |
What Then Is Dynamic Programming? | 307 |
| 379 | |
186 | 386 |
| 399 | |
| 407 | |
Druge izdaje - Prikaži vse
Dynamic Programming: Foundations and Principles, Second Edition Moshe Sniedovich Omejen predogled - 2010 |
Dynamic Programming: Foundations and Principles, Second Edition Moshe Sniedovich Predogled ni na voljo - 2010 |
Pogosti izrazi in povedi
Algorithm Algorithm C.3.1 assume Bellman c-programming Chapter Conditional Optimization conditional problems construction contraction mapping converges convex coverage function Curse of Dimensionality decision problem definition denote the set disc from peg dynamic programming functional dynamic programming model dynamic programming policies dynamic programming problem dynamic programming's entails Example feasible solutions finite formulation fractional programming global constraint Hence identity element implies instance of Problem Lemma Markov decision processes Markovian Condition Markovian policy Mathematical Analysis modified problems monotone multistage decision model nontruncated objective function Operations Research optimal policy optimal solutions optimality equation optimization problem pair parametric problem Principle of Conditional Principle of Optimality Problem P(n,s,x Problem P(s Problem Q procedure programming functional equation pseudolinear real-valued function S₁ set of optimal shortest path problem Sniedovich solution set solutions to Problem solve target problem Theorem transition function truncated validity variable VSES VzeZ Weak-Markovian xeD(n,s XED(s yields ΣΝ
Priljubljeni odlomki
Stran 398 - Applications of dynamic programming and other optimization methods in pest management, IEEE Transactions on Automatic Control, 26, 1125-1132,1981.
Stran 392 - Allocation of Screening Inspection Effort — A Dynamic Programming Approach,