2000 character limit reached
Stochastic programs without duality gaps (1105.0934v1)
Published 4 May 2011 in math.OC, cs.SY, and q-fin.PR
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.