Robust Optimization for the Newsvendor Problem with Discrete Demand

المؤلفون المشاركون

Zhai, Jia
Yu, Hui
Sun, Caihong

المصدر

Mathematical Problems in Engineering

العدد

المجلد 2018، العدد 2018 (31 ديسمبر/كانون الأول 2018)، ص ص. 1-12، 12ص.

الناشر

Hindawi Publishing Corporation

تاريخ النشر

2018-08-26

دولة النشر

مصر

عدد الصفحات

12

التخصصات الرئيسية

هندسة مدنية

الملخص 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.

نمط استشهاد جمعية علماء النفس الأمريكية (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

نمط استشهاد الجمعية الأمريكية للغات الحديثة (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

نمط استشهاد الجمعية الطبية الأمريكية (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

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

Includes bibliographical references

رقم السجل

BIM-1207930