You might also like

More about Dynamic Programming

• Book details
• Synopsis
• Trending among others

You get 125 loyalty points

Book synopsis

Humans interact with and are part of the mysterious processes of nature. Inevitably they have to discover how to manage the environment for their long-term survival and benefit. To do this successfully means learning something about the dynamics of natural processes, and then using the knowledge to work with the forces of nature for some desired outcome. These are intriguing and challenging tasks. This book describes a technique which has much to offer in attempting to achieve the latter task. A knowledge of dynamic programming is useful for anyone interested in the optimal management of agricultural and natural resources for two reasons. First, resource management problems are often problems of dynamic optimization. The dynamic programming approach offers insights into the economics of dynamic optimization which can be explained much more simply than can other approaches. Conditions for the optimal management of a resource can be derived using the logic of dynamic programming, taking as a starting point the usual economic definition of the value of a resource which is optimally managed through time. This is set out in Chapter I for a general resource problem with the minimum of mathematics. The results are related to the discrete maximum principle of control theory. In subsequent chapters dynamic programming arguments are used to derive optimality conditions for particular resources.

Book details

Book category Books in English Reference, information & interdisciplinary subjects Interdisciplinary studies

• Full title: Dynamic Programming
• Subtitle: Applications to Agriculture and Natural Resources
• Author: John O.S. Kennedy
• Language: English
• Binding: Paperback
• Number of pages: 344
• EAN: 9789401083621
• ISBN: 9401083622
• ID: 02185465
• Publisher: Springer
• Weight: 533 g
• Dimensions: 229 × 152 × 20 mm
• Date of publishing: 26. September 2011

Trending among others

---

---

---