| Dynamic Programming and Optimal Control (2 Vol Set) |  | Author: Dimitri P. Bertsekas
Publisher: Athena Scientific
Category: Book
List Price: $134.50
Buy New: $133.00
as of 5/27/2012 12:45 EDT details
You Save: $1.50 (1%)
New (6) Used (4) from $133.00
Seller: Ken Park
Sales Rank: 154,432
Languages: English (Unknown), English (Original Language), English (Published)
Media: Hardcover
Edition: 3rd
Pages: 1022
Shipping Weight (lbs): 3.3
Dimensions (in): 9.5 x 6.1 x 2.2
ISBN: 1886529086
EAN: 9781886529083
ASIN: 1886529086
Publication Date: January 29, 2007
Availability: Usually ships in 1-2 business days
| |
| Similar Items:
| |
| Editorial Reviews:
Product Description
A two-volume set, consisting of the latest editions of the two volumes (2005 for Vol. I, 2007 for Vol. II). Much supplementary material can be found at the book's web page. The first volume is oriented towards modeling, conceptualization, and finite-horizon problems, but also includes a substantive introduction to infinite horizon problems that is suitable for classroom use. The second volume is oriented towards mathematical analysis and computation, and treats infinite horizon problems extensively. This is a textbook on the far-ranging algorithmic methododogy of Dynamic Programming, which can be used for optimal control, Markovian decision problems, planning and sequential decision making under uncertainty, and discrete/combinatorial optimization. The treatment focuses on basic unifying themes, and conceptual foundations. It illustrates the versatility, power, and generality of the method with many examples and applications from engineering, operations research, and other fields. It also addresses extensively the practical application of the methodology, possibly through the use of approximations, and provides an introduction to the methodology of Neuro-Dynamic Programming, which is the focus of much recent research.
|
| |
|
|
|
CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME. Powered by Associate-O-Matic
| |
