Incorporating a number of the author's recent developments, this book 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. Along with a new appendix on the Corridor method, this edition expands the discussions of sequential decision models and the role of the state variable in modeling. It also includes a new chapter on ...
Read More
Incorporating a number of the author's recent developments, this book 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. Along with a new appendix on the Corridor method, this edition expands the discussions of sequential decision models and the role of the state variable in modeling. It also includes a new chapter on forward dynamic programming models and a new chapter on the Push method that gives a dynamic programming perspective on Dijkstra's algorithm for the shortest path problem.
Read Less
