Article ID: | iaor19952293 |
Country: | Switzerland |
Volume: | 56 |
Issue: | 1 |
Start Page Number: | 135 |
End Page Number: | 156 |
Publication Date: | Jun 1995 |
Journal: | Annals of Operations Research |
Authors: | Runggaldier W.J., Hernndez-Lerma O., Piovesan C. |
The paper concerns a numerical study of the performance of an approximate algorithm for convex stochastic control problems that was derived in a recent paper by two of the authors and is inspired by work done in the area of Stochastic Programming in connection with the Edmundson-Madansky inequality. The accuracy of the approximations is numerically tested by applying the algorithm to two classical convex stochastic control problems for which the optimal solution is known, namely the linear-quadratic and the inventory control problems.