arXiv Analytics

Sign in

arXiv:1105.0934 [math.OC]AbstractReferencesReviewsResources

Stochastic programs without duality gaps

Teemu Pennanen, Ari-Pekka Perkkiƶ

Published 2011-05-04Version 1

This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical finance. We give sufficient conditions for the existence of solutions and the absence of a duality gap. Our proof uses extended dynamic programming equations, whose validity is established under new relaxed conditions that generalize certain no-arbitrage conditions from mathematical finance.

Related articles: Most relevant | Search more
arXiv:2303.02024 [math.OC] (Published 2023-03-03, updated 2023-04-04)
Dual dynamic programming for stochastic programs over an infinite horizon
arXiv:2004.01103 [math.OC] (Published 2020-04-02)
On a class of stochastic programs with exponentially many scenarios
arXiv:1307.5151 [math.OC] (Published 2013-07-19)
SDP Duals without Duality Gaps for a Class of Convex Minimax Programs