Title
Dynamic Programming (Dover Books On Computer Science)
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the size of this book? A: The book measures five point thirty-six inches in length, zero point seventy-five inches in width, and eight point sixty-two inches in height.
- Q: How many pages does this book have? A: This book contains three hundred eighty-four pages, providing a comprehensive exploration of dynamic programming concepts.
- Q: What is the binding type of this book? A: The book is available in a paperback binding, which makes it lightweight and easy to handle.
- Q: Who is the author of this book? A: The author is Richard Bellman, a leading figure in the field of dynamic programming.
- Q: What topics does this book cover? A: The book covers mathematical theories of multistage decision processes, optimal policies, and includes various methods and theorems.
- Q: Is this book suitable for beginners? A: No, this book is intended for readers with a foundational understanding of mathematics and programming concepts.
- Q: Can I use this book for self-study? A: Yes, this book is suitable for self-study, especially with its problem sets at the end of each chapter.
- Q: What level of mathematics is required to understand this book? A: A solid understanding of calculus and basic programming concepts is recommended for readers.
- Q: How do I care for this book? A: To care for the book, keep it in a dry place and avoid exposure to moisture to prevent damage.
- Q: Is this book safe for children? A: Yes, while the content is technical, there is no adult material, but parental guidance on the subject matter is advised.
- Q: Can I return this book if I am not satisfied? A: Yes, you can typically return the book if you are not satisfied, but check the seller's return policy for specific details.
- Q: What if the book arrives damaged? A: If the book arrives damaged, contact the seller immediately to discuss return or replacement options.
- Q: Is there a warranty on this book? A: No, books generally do not come with a warranty like electronic products do.
- Q: How do I find similar books in this genre? A: You can find similar books in the Microsoft Programming category or by searching for titles by Richard Bellman.
- Q: What are the unique features of this book? A: Unique features include detailed methods, existence theorems, and problem sets designed to enhance understanding of dynamic programming.
- Q: Are there illustrations in this book? A: Yes, the book includes thirty-seven figures to help illustrate key concepts and methods.