Transforming Stochastic Dynamic Programming Problems into Nonlinear Programs

Published Online:https://doi.org/10.1287/mnsc.17.7.450

This paper investigates conditions under which stochastic dynamic programs easily reduce to static deterministic programs. The conditions, though strict, are still rich enough to aid in the solution of a number of practical problems.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.