343
Views
0
CrossRef citations to date
0
Altmetric
Research Article

On the optimal solution of a distributionally robust multi-product newsvendor problem

, ORCID Icon & ORCID Icon
Pages 2578-2592 | Received 07 Dec 2021, Accepted 18 Dec 2022, Published online: 05 Jan 2023

References

  • Abdel-Malek, L., Montanari, R., & Morales, L. C. (2004). Exact, approximate, and generic iterative models for the multi-product newsboy problem with budget constraint. International Journal of Production Economics, 91(2), 189–198. https://doi.org/10.1016/j.ijpe.2003.09.004
  • Bassok, Y., Anupindi, R., & Akella, R. (1999). Single-period multiproduct inventory models with substitution. Operations Research, 47(4), 632–642. https://doi.org/10.1287/opre.47.4.632
  • Choi, S. (2012). A multi-item risk-averse newsvendor with law invariant coherent measures of risk. Handbook of newsvendor problems (pp. 41–79). Springer.
  • Choi, S., Ruszczyński, A., & Zhao, Y. (2011). A multiproduct risk-averse newsvendor with law-invariant coherent measures of risk. Operations Research, 59(2), 346–364. https://doi.org/10.1287/opre.1100.0896
  • Dutta, P., & Chakraborty, D. (2010). Incorporating one-way substitution policy into the newsboy problem with imprecise customer demand. European Journal of Operational Research, 200(1), 99–110. https://doi.org/10.1016/j.ejor.2008.12.011
  • Erlebacher, S. J. (2009). Optimal and heuristic solutions for the multi-item newsvendor problem with a single capacity constraint. Production and Operations Management, 9(3), 303–318. https://doi.org/10.1111/j.1937-5956.2000.tb00139.x
  • Gallego, G., & Moon, I. (1993). The distribution free newsboy problem: Review and extensions. Journal of the Operational Research Society, 44(8), 825–834. https://doi.org/10.1057/jors.1993.141
  • Hadley, G., & Whitin, T. M. (1963). Analysis of inventory systems. Prentice–Hall.
  • Jiang, H., Netessine, S., & Savin, S. (2011). Robust newsvendor competition under asymmetric information. Operations Research, 59(1), 254–261. https://doi.org/10.1287/opre.1100.0858
  • Lau, H.-S., & Lau, A. H.-L. (1996). The newsstand problem: A capacitated multiple-product single-period inventory problem. European Journal of Operational Research, 94(1), 29–42. https://doi.org/10.1016/0377-2217(95)00192-1
  • Lei, L., Ru, J., Shi, R., & Zhang, J. (2022). A two-product newsvendor problem with partial demand substitution. Production and Operations Management, 31(3), 1157–1173. https://doi.org/10.1111/poms.13599
  • Li, Z., & Fu, Q. (2017). Robust inventory management with stock-out substitution. International Journal of Production Economics, 193, 813–826. https://doi.org/10.1016/j.ijpe.2017.09.011
  • Lim, Y. F., Jiu, S., & Ang, M. (2021). Integrating anticipative replenishment allocation with reactive fulfillment for online retailing using robust optimization. Manufacturing & Service Operations Management, 23(6), 1616–1633. https://doi.org/10.1287/msom.2020.0926
  • Lim, Y. F., & Wang, C. (2017). Inventory management based on target-oriented robust optimization. Management Science, 63(12), 4409–4427. https://doi.org/10.1287/mnsc.2016.2565
  • Moon, I., & Silver, E. A. (2000). The multi-item newsvendor problem with a budget constraint and fixed ordering costs. Journal of the Operational Research Society, 51(5), 602–608. https://doi.org/10.1057/palgrave.jors.2600938
  • Nagarajan, M., & Rajagopalan, S. (2008). Inventory models for substitutable products: Optimal policies and heuristics. Management Science, 54(8), 1453–1466. https://doi.org/10.1287/mnsc.1080.0871
  • Nahmias, S., & Schmidt, C. P. (1984). An efficient heuristic for the multi-item newsboy problem with a single constraint. Naval Research Logistics Quarterly, 31(3), 463–474. https://doi.org/10.1002/nav.3800310311
  • Prak, D., Teunter, R., Babai, M. Z., Boylan, J. E., & Syntetos, A. (2021). Robust compound Poisson parameter estimation for inventory control. Omega, 104, 102481. https://doi.org/10.1016/j.omega.2021.102481
  • Qiu, R., Sun, M., & Lim, Y. F. (2017). Optimizing (s, s) policies for multi-period inventory models with demand distribution uncertainty: Robust dynamic programing approaches. European Journal of Operational Research, 261(3), 880–892. https://doi.org/10.1016/j.ejor.2017.02.027
  • Qiu, R., Sun, Y., & Sun, M. (2021). A distributionally robust optimization approach for multi-product inventory decisions with budget constraint and demand and yield uncertainties. Computers & Operations Research, 126, 105081. https://doi.org/10.1016/j.cor.2020.105081
  • Scarf, H. E. (1957). A min-max solution of an inventory problem. In K. Arrow, S. Karlin, and H. Scarf (Eds.), Studies in the mathematical theory of inventory and production (pp. 201–209). Stanford University Press.
  • Smith, S. A., & Agrawal, N. (2000). Management of multi-item retail inventory systems with demand substitution. Operations Research, 48(1), 50–64. https://doi.org/10.1287/opre.48.1.50.12443
  • Turken, N., Tan, Y., Vakharia, A. J., Wang, L., Wang, R., & Yenipazarli, A. (2012). The multi-product newsvendor problem: Review, extensions, and directions for future research. Handbook of newsvendor problems (pp. 3–39). Springer.
  • Zhang, J., Xie, W., & Sarin, S. C. (2021a). Multiproduct newsvendor problem with customer-driven demand substitution: A stochastic integer program perspective. INFORMS Journal on Computing, 33(3), 1229–1244. https://doi.org/10.1287/ijoc.2020.0996
  • Zhang, J., Xie, W., & Sarin, S. C. (2021b). Robust multi-product newsvendor model with uncertain demand and substitution. European Journal of Operational Research, 293(1), 190–202. https://doi.org/10.1016/j.ejor.2020.12.023

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.