Algorithms for solving Lagrangian multistage decision problems

This paper considers issues relating to the analysis and solution via dynamic programming of multistage and sequential decision problems having Lagrangian type objective functions. Three schemes which exploit the multistage structure of the dynamic programming recursion are discussed and compared. Numerical results obtained from the application of these schemes to a reliability constrained inventory control problem are presented.