Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of discrete stochastic demands under periodic review and finite time horizon. A closely related problem is the single-period newsvendor model. It is well known that the newsvendor problem admit...
Main Authors: | Halman, Nir (Contributor), Simchi-Levi, David (Contributor), Orlin, James B. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering (Contributor), Sloan School of Management (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS),
2013-02-27T21:05:40Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
by: Halman, Nir, et al.
Published: (2017) -
Robust Stochastic Lot-Sizing by Means of Histograms
by: Klabjan, Diego, et al.
Published: (2013) -
Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
by: Levi, Retsef, et al.
Published: (2014) -
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
by: Halman, Nir, et al.
Published: (2018) -
A fix-and-optimize heuristic for the capacitated multi-item stochastic lot-sizing problem
by: M. Edib Gurkan, et al.
Published: (2020-12-01)