Dynamic programming foundations and principles / [electronic resource] :
- 作者： Sniedovich, Moshe, 1945-
- 其他題名：
- Monographs and textbooks in pure and applied mathematics
- 出版： Boca Raton : CRC Press
- 版本：2nd ed.
- 叢書名： Monographs and textbooks in pure and applied mathematics
- 主題： Dynamic programming , Mathematics , Electronic books.
- ISBN： 9781420014631 (electronic bk.) 、 1420014633 (electronic bk.)
-
FIND@SFXID:
CGU
- 資料類型: 電子書
- 內容註: Includes bibliographical references and index. Front cover; Preface (first edition); List of Figures; List of Tables; Contents; Chapter 1. Introduction; Chapter 2. Fundamentals; Chapter 3. Multistage Decision Model; Chapter 4. Dynamic Programming -- An Outline; Chapter 5. Solution Methods; Chapter 6. Successive Approximation Methods; Chapter 7. Optimal Policies; Chpater 8. The Curse of Dimensionality; Chapter 9. The Rest Is Mathematics and Experience; Chapter 10. Refinements; Chapter 11. The State; Chapter 12. Parametric Schemes; Chapter 13. The Principle of Optimality; Chapter 14. Forward Decomposition; Chapter 15. Push! "A Chapman & Hall book."
- 摘要註: Focusing on the modeling and solution of deterministic multistage decision problems, this book looks at dynamic programming as a problem-solving optimization method. With over 400 useful references, this edition discusses the dynamic programming analysis of a problem, illustrates the rationale behind this analysis, and clarifies the theoretical grounds that justify the rationale. It also explains the meaning and role of the concept of state in dynamic programming, examines the purpose and function of the principle of optimality, and outlines solution strategies for problems defiant of conventi.
-
讀者標籤：
- 系統號： 005109350 | 機讀編目格式
館藏資訊
Incorporating a number of the author’s recent ideas and examples, Dynamic Programming: Foundations and Principles, Second Edition presents a comprehensive and rigorous treatment of dynamic programming. The author emphasizes the crucial role that modeling plays in understanding this area. He also shows how Dijkstra’s algorithm is an excellent example of a dynamic programming algorithm, despite the impression given by the computer science literature. New to the Second Edition Expanded discussions of sequential decision models and the role of the state variable in modeling A new chapter on forward dynamic programming models A new chapter on the Push method that gives a dynamic programming perspective on Dijkstra’s algorithm for the shortest path problem A new appendix on the Corridor method Taking into account recent developments in dynamic programming, this edition continues to provide a systematic, formal outline of Bellman’s approach to dynamic programming. It looks at dynamic programming as a problem-solving methodology, identifying its constituent components and explaining its theoretical basis for tackling problems.