By Dimitri Bertsekas

ISBN-10: 1886529264

ISBN-13: 9781886529267

The 1st of the 2 volumes of the top and newest textbook at the far-ranging algorithmic methododogy of Dynamic Programming, that are used for optimum keep an eye on, Markovian choice difficulties, making plans and sequential determination making less than uncertainty, and discrete/combinatorial optimization. The remedy specializes in uncomplicated unifying issues, and conceptual foundations. It illustrates the flexibility, strength, and generality of the strategy with many examples and functions from engineering, operations study, and different fields. It additionally addresses widely the sensible program of the method, very likely by utilizing approximations, and gives an creation to the far-reaching technique of Neuro-Dynamic Programming. the 1st quantity is orientated in the direction of modeling, conceptualization, and finite-horizon difficulties, but additionally features a sizeable creation to endless horizon difficulties that's appropriate for lecture room use. the second one quantity is orientated in the direction of mathematical research and computation, and treats countless horizon difficulties broadly. The textual content includes many illustrations, worked-out examples, and routines.