Information Relaxations and Duality in Stochastic Dynamic Programs: A Review and Tutorial
Foundations and Trends in Optimization · 2022
DOI: 10.1561/2400000027 ↗At a glance
Journal article in Foundations and Trends in Optimization, 2022. Written by David B. Brown and 1 co-authors. Cited 12 times so far (Crossref); 80 references.
Abstract (original language)
In this monograph, we provide an overview of the information relaxation approach for calculating performance bounds in stochastic dynamic programs (DPs). The technique involves (1) relaxing the temporal feasibility (or nonanticipativity) constraints so the decision-maker (DM) has additional information before making decisions, and (2) incorporating a penalty that punishes the DM for violating the temporal feasibility constraints. The goal of this monograph is to provide a self-contained overview of the key theoretical results of the information relaxation approach as well as a review of research that has successfully used these techniques in a broad range of applications. We illustrate the information relaxation approach on applications in inventory management, assortment planning, and portfolio optimization.
Cite
APA
Brown, D. B., & Smith, J. E. (2022). Information Relaxations and Duality in Stochastic Dynamic Programs: A Review and Tutorial. Foundations and Trends in Optimization. https://doi.org/10.1561/2400000027
Vancouver
Brown DB, Smith JE. Information Relaxations and Duality in Stochastic Dynamic Programs: A Review and Tutorial. Foundations and Trends in Optimization. 2022. doi:10.1561/2400000027
BibTeX
@article{Brown2022,
author = {Brown, David B. and Smith, James E.},
title = {Information Relaxations and Duality in Stochastic Dynamic Programs: A Review and Tutorial},
journal = {Foundations and Trends in Optimization},
year = {2022},
doi = {10.1561/2400000027}
}
EUVIMED