|
|
|
|
LEADER |
04056nmm a2200445 u 4500 |
001 |
EB002120082 |
003 |
EBX01000000000000001258139 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
221028 ||| eng |
020 |
|
|
|a 0080955444
|
020 |
|
|
|a 9780080955445
|
020 |
|
|
|a 9780124023505
|
050 |
|
4 |
|a T57.83
|
100 |
1 |
|
|a Kaufmann, A.
|
245 |
0 |
0 |
|a Dynamic programming
|b sequential scientific management
|c [edited by] A. Kaufmann [and] R. Cruon ; translated by Henry C. Sneyd
|
260 |
|
|
|a London
|b Academic Press
|c 1967, 1967
|
300 |
|
|
|a 1 online resource
|
505 |
0 |
|
|a 36. Optimization of the Average Value per Period in the Special Case of a Certain Future37. Decomposed Form; Chapter 6. Various Generalizations; 38. Introduction; 39. Nonsequential Structures; 40. Nonadditive Values; Bibliography; I. Theory; II. Practice; Subject Index; Mathematics in Science and Engineering
|
505 |
0 |
|
|a Includes bibliographical references and index
|
505 |
0 |
|
|a 26. The Criterion of the Average Expected Value per Period27. Optimization of the Average Value per Period; Chapter 5. Discrete D.H. Dynamic Programs With Finite Markovian Chains; 28. Introduction; 29. Structure of Finite Markovian Chains; 30. Irreducible Finite Markovian Chain7; 31. The Generating Function (z-Transform); 32. Quantitative Study of Finite Markovian Chains; 33. Value of a Permanent Strategy; 34. Optimization of the Total Present Value; 35. Optimization of the Average Value per Period (or of the Total Value)
|
505 |
0 |
|
|a 7. The Case where the Decision Variable Has More Dimensions than the State Variable8. Case where the Final and Initial States Are N o t Both Prescribed; 9. Comparison of the Four Methods; 10. Stationary Programs. Convergence. Permanent Policies; Chapter 2. Discrete Dynamic Programs With a Certain Future and an Unlimited Horizon; 11. Introduction; 12. Convergence by ''Narrowing" the Domain of Decision; 13. The Criterion of the Present Value; 14. Criterion of the Average Value per Period; Chapter 3. Discrete Dynamic Programs With a Random Future and Limited Horizon; 15. introduction
|
505 |
0 |
|
|a Front Cover; Dynamic Programming: Sequential Scientific Management; Copyright Page; Foreword to The French Edition; Contents; Preface to The French Edition; List of Principal Symbols; Chapter 1. Discrete Dynamic Programs With a Certain Future and a Limited Horizon; 1. General Introduction; 2. A Numerical Example; 3. Mathematical Model of a Discrete Dynamic Program with a Certain Future; 4. Interpretation by the Theory of Graphs. Multistage Graphs; 5. Explanation of Certain Difficulties in the Calculations; 6. A Numerical Example Which is Nonlinear
|
505 |
0 |
|
|a 16. An Example of D.H. (Décision-Hasard) Dynamic Program17. Mathematical Model of a D.H. Dynamic Program. Decomposed Form; 18. Mathematical Model of an H. D. Dynamic Program. Decomposed Form; 19. Examples; Chapter 4. Discrete Dynamic Programs With a Random Future and Unlimited Horizon (General Case); 20. Introduction; 21. Criterion of the Expected Total Value; 22. Approximation in the Space of the Strategies; 23. Convergence of the Total Present Value of an Arbitrary Strategy; 24. Influence of the Initial State; 25. The Criterion of the Expected Total Value without Discounting
|
653 |
|
|
|a Dynamic programming / http://id.loc.gov/authorities/subjects/sh85040313
|
653 |
|
|
|a MATHEMATICS / Linear & Nonlinear Programming / bisacsh
|
653 |
|
|
|a Programmation dynamique
|
653 |
|
|
|a Dynamic programming / fast / (OCoLC)fst00900291
|
700 |
1 |
|
|a Cruon, R.
|
700 |
1 |
|
|a Sneyd, Henry C.
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
490 |
0 |
|
|a Mathematics in science and engineering
|
776 |
|
|
|z 0080955444
|
776 |
|
|
|z 0124023509
|
776 |
|
|
|z 9780124023505
|
776 |
|
|
|z 9780080955445
|
856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/00765392/37
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 519.7/03
|
520 |
|
|
|a Dynamic programming; sequential scientific management
|