Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
We present a framework for obtaining fully polynomial time approximation schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period cost functions. This framework is developed through the establishment of two sets of computational rules, namely, the calc...
Main Authors: | Halman, Nir (Author), Klabjan, Diego (Author), Li, Chung-Lun (Author), Orlin, James B (Contributor), Simchi-Levi, David (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering (Contributor), Massachusetts Institute of Technology. Institute for Data, Systems, and Society (Contributor), Sloan School of Management (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2017-05-17T13:53:29Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
by: Halman, Nir, et al.
Published: (2013) -
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
by: Halman, Nir, et al.
Published: (2018) -
Robust Stochastic Lot-Sizing by Means of Histograms
by: Klabjan, Diego, et al.
Published: (2013) -
Optimal Expediting Policies for a Serial Inventory System with Stochastic Lead Time and Visibility of Orders in Transit
by: Kim, Chiwon, et al.
Published: (2016) -
Fully polynomial time approximation schemes for sequential decision problems
by: Mostagir, Mohamed
Published: (2006)