Bookbot

Dynamic Programming

Hodnotenie knihy

Viac o knihe

An introduction to the mathematical theory of multistage decision processes, this text takes a "functional equation" approach to the discovery of optimum policies. Written by a leading developer of such policies, it presents a series of methods, uniqueness and existence theorems, and examples for solving the relevant equations. The text examines existence and uniqueness theorems, the optimal inventory equation, bottleneck problems in multistage production processes, a new formalism in the calculus of variation, strategies behind multistage games, and Markovian decision processes. Each chapter concludes with a problem set that Eric V. Denardo of Yale University, in his informative new introduction, calls "a rich lode of applications and research topics." 1957 edition. 37 figures.

Nákup knihy

Dynamic Programming, Richard E. Bellman, Stuart E. Dreyfus

Jazyk
Rok vydania
2003
product-detail.submit-box.info.binding
(mäkká)
Akonáhle sa objaví, pošleme e-mail.

Platobné metódy

4,4
Veľmi dobrá
22 Hodnotenie

Tu nám chýba tvoja recenzia

Titul
Dynamic Programming
Jazyk
anglicky
Rok vydania
2003
Väzba
mäkká
Počet strán
366
ISBN10
0486428095
ISBN13
9780486428093
Série
Hodnotenie
4,35 z 5
Anotácia
An introduction to the mathematical theory of multistage decision processes, this text takes a "functional equation" approach to the discovery of optimum policies. Written by a leading developer of such policies, it presents a series of methods, uniqueness and existence theorems, and examples for solving the relevant equations. The text examines existence and uniqueness theorems, the optimal inventory equation, bottleneck problems in multistage production processes, a new formalism in the calculus of variation, strategies behind multistage games, and Markovian decision processes. Each chapter concludes with a problem set that Eric V. Denardo of Yale University, in his informative new introduction, calls "a rich lode of applications and research topics." 1957 edition. 37 figures.