Please use this identifier to cite or link to this item: https://doi.org/10.1137/060665506
Title: Successive linear approximation solution of infinite-horizon dynamic stochastic programs
Authors: Birge, J.R.
Zhao, G. 
Keywords: Cutting planes
Dynamic programming
Infinite horizon
Linear approximation
Stochastic programming
Issue Date: 2007
Citation: Birge, J.R., Zhao, G. (2007). Successive linear approximation solution of infinite-horizon dynamic stochastic programs. SIAM Journal on Optimization 18 (4) : 1165-1186. ScholarBank@NUS Repository. https://doi.org/10.1137/060665506
Abstract: Models for long-term planning often lead to infinite-horizon stochastic programs that offer significant challenges for computation. Finite-horizon approximations are often used in these cases, but they may also become computationally difficult. In this paper, we directly solve for value functions of infinite-horizon stochastic programs. We show that a successive linear approximation method converges to an optimal value function for the case with convex objective, linear dynamics, and feasible continuation. © 2007 Society for Industrial and Applied Mathematics.
Source Title: SIAM Journal on Optimization
URI: http://scholarbank.nus.edu.sg/handle/10635/104216
ISSN: 10526234
DOI: 10.1137/060665506
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.