Applied Dynamic Programming
Princeton University Press, 1962 - Dynamic programming - 363 pages
One-dimensional allocation processes; Multidimensional allocation processes; One-dimensional smoothing and scheduling processes; Optimal search techniques; Dynamic programming and the calculus of variations; Optimal trajectories; Multistage production processes utilizing complexes of industries; Feedback control processes; Computational results for feedback control processes; Linear equations and quadratic criteria; Markovian decision processes; Numerical analysis.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Verbal Description of the Allocation Process
215 other sections not shown
Other editions - View all
allocation process analysis analytic solution assume Bellman calculation calculus of variations capacity cargo-loading Chapter COMMENTS AND BIBLIOGRAPHY components components in parallel computational solution consider constraints control processes decision defective coin demand point Depot determine differential equations digital computer dimensionality discussion dynamic programming approach Euler equation example Figure fk(x Flow Chart fN(x foregoing formulation functional equation technique given gN(xN grid integer iteration Johnniac Lagrange multiplier linear programming Management Science Math mathematical maximizing the function maximum method minimize minimum obtain one-dimensional Operations Research optimal policy partial differential equation Poisson distribution problem involving problem of maximizing production quantity RAND Corporation recurrence relation reliability replacement return function sequence of functions simple solve Step successive approximations suppose theory two-dimensional types of items unimodal function values variables variational problem weight wish WjCi yields zero