Information Relaxations and Duality in Stochastic Dynamic Programs 2: With a Common Generating Function, a Looser Information Relaxation Gives a Weaker Dual BoundResearch Paper
Many stochastic dynamic programs in operations research, such as inventory control with partially observed demand or the pricing of American options, are too large to solve exactly. A heuristic policy gives a lower bound on the optimal expected reward; to judge whether it is good enough one needs an upper bound. Brown, Smith and Sun (Oper. Res. 2010) build…