Search Images Maps Play YouTube News Gmail Drive More »
My library | Help | Advanced Book Search | Web History | Sign in

Books

Dynamic programming

Front Cover
3 Reviews
Courier Dover Publications, 2003 - Computers - 340 pages
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.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Related books

Contents

III
3
IV
4
V
5
VI
7
VII
9
VIII
10
X
11
XI
12
CIII
205
CIV
207
CV
209
CVI
211
CVIII
214
CIX
215
CX
217
CXI
218

XII
16
XIV
19
XV
20
XVI
22
XVII
25
XVIII
26
XIX
28
XX
29
XXI
30
XXII
31
XXIII
33
XXIV
34
XXV
37
XXVI
38
XXVII
39
XXVIII
40
XXIX
61
XXX
62
XXXI
63
XXXIII
64
XXXIV
65
XXXV
66
XXXVI
69
XXXVIII
71
XXXIX
72
XL
74
XLI
76
XLII
77
XLIII
79
XLIV
81
XLV
83
XLVII
85
XLVIII
86
XLIX
87
LII
88
LIII
90
LIV
115
LV
116
LVI
117
LVII
119
LVIII
121
LIX
122
LX
123
LXI
124
LXII
125
LXIII
132
LXIV
151
LXV
152
LXVI
153
LXVII
154
LXVIII
156
LXXI
157
LXXIII
158
LXXIV
159
LXXV
164
LXXVI
166
LXXVII
169
LXXIX
171
LXXXI
172
LXXXII
173
LXXXIV
176
LXXXV
178
LXXXVI
182
LXXXVII
183
LXXXVIII
184
LXXXIX
187
XC
188
XCI
189
XCII
191
XCIII
192
XCV
193
XCVII
194
XCVIII
197
XCIX
200
C
202
CI
203
CII
204
CXII
221
CXIII
222
CXIV
223
CXV
224
CXVII
226
CXVIII
227
CXX
228
CXXI
229
CXXII
230
CXXIII
231
CXXIV
233
CXXV
234
CXXVI
235
CXXVII
236
CXXVIII
241
CXXIX
242
CXXX
244
CXXXI
245
CXXXII
246
CXXXIII
251
CXXXV
252
CXXXVI
253
CXXXVII
254
CXXXVIII
255
CXXXIX
256
CXL
258
CXLI
260
CXLII
263
CXLIII
264
CXLIV
265
CXLV
266
CXLVI
267
CXLVII
268
CXLVIII
269
CXLIX
270
CLI
271
CLII
272
CLIII
273
CLV
274
CLVI
282
CLVII
283
CLVIII
284
CLIX
285
CLX
286
CLXI
287
CLXIII
288
CLXIV
289
CLXV
291
CLXVI
292
CLXVII
294
CLXVIII
295
CLXIX
297
CLXX
299
CLXXI
300
CLXXIII
302
CLXXV
303
CLXXVI
306
CLXXVII
307
CLXXVIII
308
CLXXX
309
CLXXXI
310
CLXXXII
315
CLXXXIII
317
CLXXXIV
319
CLXXXV
320
CLXXXVI
321
CLXXXVII
324
CLXXXVIII
325
CXC
326
CXCI
328
CXCII
330
CXCIII
332
CXCV
334
CXCVI
336
CXCVII
338
CXCVIII
339
Copyright

Other editions - View all

Common terms and phrases

References to this book

From other books

Introduction To Algorithms
Fuzzy Set Theory-And Its Applications
All Book Search results »

From Google Scholar

Decision-Making in a Fuzzy Environment
RE Bellman, LA Zadeh - 1970 - Management Science
A Neural Substrate of Prediction and Reward
Wolfram Schultz, Peter Dayan, P Read Montague - 1997 - Science
Constrained model predictive control: Stability and optimality
DQ Mayne, JB Rawlings, CV Rao, POM Scokaert - 2000 - Automatica
Multicast Routing in Datagram Internetworks and Extended LANs
STEPHEN E DEERING, DAVID R CHERITON - 1990 - ACM Transactions on Computer Systems
All Scholar search results »

References from web pages

Dynamic programming - Wikipedia, the free encyclopedia
In mathematics and computer science, dynamic programming is a method of solving problems exhibiting the properties of overlapping subproblems and optimal ...
en.wikipedia.org/ wiki/ Dynamic_programming

Dynamic programming: an introduction
This way of tackling the problem backwards is Dynamic programming. ... Dynamic programming was the brainchild of an American Mathematician, Richard Bellman, ...
plus.maths.org/ issue3/ dynamic/ index.html

What is dynamic programming?
Dynamic programming algorithms are a. good place to start understanding what’s ... Dynamic programming was. formalized in the early 1950s by mathemati- ...
selab.janelia.org/ pub/ publications/ Eddy-ATG1/ Eddy-ATG1-reprint.pdf

Interpolating Value Functions in Discrete Choice Dynamic ...
Structural discrete choice dynamic programming models have been shown to be a valuable tool for analyzing a wide range of economic behavior. ...
mpra.ub.uni-muenchen.de/ 864/

What is dynamic programming? - Nature Biotechnology
Sequence alignment methods often use something called a 'dynamic programming' algorithm. What is dynamic programming and how does it work? ...
www.nature.com/ nbt/ journal/ v22/ n7/ full/ nbt0704-909.html

Chapter 6 Dynamic Programming
Dynamic programming. Break up a problem into a series of overlapping sub-problems, and build up solutions to larger and larger sub-problems. ...
www.cp.eng.chula.ac.th/ ~piak/ teaching/ algo/ algo2007/ 06dynamic-programming.ppt

Fuzzy dynamic programming: theory and applications to decision and ...
of dynamic programming. Incursions into many disciplines such as mathematics, ... In dynamic programming, we are particularly interested in problems of ...
ieeexplore.ieee.org/ iel5/ 6323/ 16906/ 00781644.pdf

JSTOR: Dynamic Programming and the Calculus of Variations.
Dynamic Programming and the Calculus of Variations. By STUART E. DREYFUS. Academic Press, Inc., New York, 1965. xix + 248 pp. Before going into the review ...
links.jstor.org/ sici?sici=0036-1445(196610)8%3A4%3C547%3ADPATCO%3E2.0.CO%3B2-A

Dynamic Programming
Dynamic Programming. Richard Bellman. Man is. a. decision-making ani- .... Dynamic programming supplies. a. systematic technique for determining ...
www.sciencemag.org/ cgi/ reprint/ 153/ 3731/ 34.pdf

Dynamic Programming: A Discrete Calculus of Variations
Dynamic programming is one of those computational techniques that many people hear about but few really understand and use with confidence in its full ...
doi.ieeecomputersociety.org/ 10.1109/ MCSE.1997.10006

About the author (2003)

Richard Ernest Bellman (1920-1984) is best known as the father of dynamic programming. He was the author of many books and the recipient of many honors, including the first Norbert Wiener Prize in Applied Mathematics.

Bibliographic information