Information relaxations, duality, and convex stochastic dynamic programs
Year of publication: |
2014
|
---|---|
Authors: | Brown, David B. ; Smith, James E. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 62.2014, 6, p. 1394-1415
|
Subject: | dynamic programming | information relaxations | network revenue management | lost-sales inventory models | Dynamische Optimierung | Dynamic programming | Mathematische Optimierung | Mathematical programming | Revenue-Management | Revenue management | Lagerhaltungsmodell | Inventory model | Theorie | Theory |
-
A dynamic disaggregation approach to approximate linear programs for network revenue management
Vossen, Thomas W. M., (2015)
-
Wang, Kangzhou, (2013)
-
Optimal ordering decisions and revenue sharing in a single period split order supply chain
Kalpana, P., (2011)
- More ...
-
Dynamic portfolio optimization with transaction costs : heuristics and dual bounds
Brown, David B., (2011)
-
Index policies and performance bounds for dynamic selection problems
Brown, David B., (2020)
-
Dynamic Portfolio Optimization with Transaction Costs: Heuristics and Dual Bounds
Brown, David B., (2011)
- More ...