Heuristic Procedures in Dynamic Programming |
Contents
SUCCESSIVE REDUCTIONS IN GRID SIZEAN ECONOMIC | 6 |
PATH RESTRICTION | 19 |
THE USE OF EXPECTATIONS IN STOCHASTIC DYNAMIC | 27 |
11 | 34 |
STATE REDUCTION BY IDENTIFYING PROBLEM | 38 |
THE PRACTICAL USE OF THE PROCEDURES | 71 |
Other editions - View all
Common terms and phrases
2400-state problem 2400-state system aggregate alternatives application of Howard's approximate policy approximate state values approximation method average monthly cost Bellman chapter characteristics complete model complete system control variable described deterministic system discount factor dynamic programming equipment of rating equipment ratings example expected values filler order last find the optimal functional equation gain per period Gaussian elimination Howard's method I₁ initial load installed inventory item of rating k₁ linear programming Markov Chains month n₁ number of possible operational researcher overloaded P₁ P₂ path restriction Persistent Decisions policy improvement operation probability distributions procedure rate of growth reduced model reduced system reductions in grid replaced s)ds S₁ S2 S₂ sequence shift on machine shift status simulation single policy improvement stage stochastic storage requirements sub-system Suppose Table test quantity transformal transition probability matrices value determination operation Vn(i μ+Ζ µsecs
References to this book
Operations Research: Methoden und Modelle. Für Wirtschaftsingenieure ... Hans-Jürgen Zimmermann No preview available - 2007 |