Dynamic programming in convex stochastic optimization

Teemu Pennanen, Ari-Pekka Perkkio

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
97 Downloads (Pure)


This paper studies the dynamic programming principle for general convex stochastic optimization problems introduced by R. T. Rockafellar and R. J-B Wets [Nonanticipativity and L1-martingales in stochastic optimization problems, Math. Programming Studies 6 (1976) 170--187]. We extend the applicability of the theory by relaxing compactness and boundedness assumptions. In the context of financial mathematics, the relaxed assumptions are satisfied under the well-known no-arbitrage condition and the "reasonable asymptotic elasticity" condition of the utility function. Besides financial mathematics, we obtain several new results in linear and nonlinear stochastic programming and stochastic optimal control.
Original languageEnglish
Pages (from-to)1241-1283
Issue number2
Publication statusPublished - 5 May 2023


Dive into the research topics of 'Dynamic programming in convex stochastic optimization'. Together they form a unique fingerprint.

Cite this