×

Numerical solution of continuous-state dynamic programs using linear and spline interpolation. (English) Zbl 0777.90074

Summary: This paper demonstrates that the computational effort required to develop numerical solutions to continuous-state dynamic programs can be reduced significantly when cubic piecewise polynomial functions, rather than tensor product linear interpolants, are used to approximate the value function. Tensor product cubic splines, represented in either piecewise polynomial or \(B\)-spline form, and multivariate Hermite polynomials are considered. Computational savings are possible because of the improved accuracy of higher-order functions and because the smoothness of higher- order functions allows efficient quasi-Newton methods to be used to compute optimal decisions. The use of the more efficient piecewise polynomial form of the spline was slightly superior to the use of Hermite polynomials for the test problem and easier to program. In comparison to linear interpolation, use of splines in piecewise polynomial form reduced the CPU time to obtain results of equivalent accuracy by a factor of 250- 330 for a stochastic 4-dimensional water supply reservoir problem with a smooth objective function, and factors ranging from 25-400 for a sequence of 2-, 3-, 4-, and 5-dimensional problems. As a result, a problem that required two hours to solve with linear interpolation was solved in a less than a minute with spline interpolation with no loss of accuracy.

MSC:

90C39 Dynamic programming
93C55 Discrete-time control/observation systems
93C30 Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)
90-08 Computational methods for problems pertaining to operations research and mathematical programming
PDFBibTeX XMLCite
Full Text: DOI