dc.contributor.author | Halman, Nir | |
dc.contributor.author | Klabjan, Diego | |
dc.contributor.author | Li, Chung-Lun | |
dc.contributor.author | Orlin, James B | |
dc.contributor.author | Simchi-Levi, David | |
dc.date.accessioned | 2017-05-17T13:53:29Z | |
dc.date.available | 2017-05-17T13:53:29Z | |
dc.date.issued | 2014-10 | |
dc.date.submitted | 2013-06 | |
dc.identifier.issn | 0895-4801 | |
dc.identifier.issn | 1095-7146 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/109135 | |
dc.description.abstract | 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 calculus of K-approximation functions and the calculus of K-approximation sets. Using our framework, we provide the first FPTASs for several NP-hard problems in various fields of research such as knapsack models, logistics, operations management, economics, and mathematical finance. Extensions of our framework via the use of the newly established computational rules are also discussed. | en_US |
dc.language.iso | en_US | |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1137/130925153 | en_US |
dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
dc.source | SIAM | en_US |
dc.title | Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Halman, Nir; Klabjan, Diego; Li, Chung-Lun; Orlin, James and Simchi-Levi, David. “Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs.” SIAM Journal on Discrete Mathematics 28, no. 4 (January 2014): 1725–1796. © 2014 Society for Industrial and Applied Mathematics | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Institute for Data, Systems, and Society | en_US |
dc.contributor.department | Sloan School of Management | en_US |
dc.contributor.mitauthor | Orlin, James B | |
dc.contributor.mitauthor | Simchi-Levi, David | |
dc.relation.journal | SIAM Journal on Discrete Mathematics | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Halman, Nir; Klabjan, Diego; Li, Chung-Lun; Orlin, James; Simchi-Levi, David | en_US |
dspace.embargo.terms | N | en_US |
dc.identifier.orcid | https://orcid.org/0000-0002-7488-094X | |
dc.identifier.orcid | https://orcid.org/0000-0002-4650-1519 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |