Robust Optimization for the Newsvendor Problem with Discrete Demand
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-12, 12 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-08-26
Country of Publication
Egypt
No. of Pages
12
Main Subjects
Abstract EN
A robust newsvendor model with discrete demand is initiatively studied, and the steps to obtain the optimal ordering decision are provided.
The study shows that the optimal ordering decision with discrete demand is very different from that with continuous demand.
Besides, the total number of demand points has almost no effect on the performance of both ordering decisions.
Furthermore, for an ultralow-profit product, the ordering decision with discrete demand performs significantly better than that with continuous demand.
American Psychological Association (APA)
Zhai, Jia& Yu, Hui& Sun, Caihong. 2018. Robust Optimization for the Newsvendor Problem with Discrete Demand. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1207930
Modern Language Association (MLA)
Zhai, Jia…[et al.]. Robust Optimization for the Newsvendor Problem with Discrete Demand. Mathematical Problems in Engineering No. 2018 (2018), pp.1-12.
https://search.emarefa.net/detail/BIM-1207930
American Medical Association (AMA)
Zhai, Jia& Yu, Hui& Sun, Caihong. Robust Optimization for the Newsvendor Problem with Discrete Demand. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1207930
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1207930