Author
Listed:
- Yi Wang
- Li Xiao
- Xing-Gang Luo
Abstract
This paper derives the optimal solution for a distributionally robust multi-product newsvendor problem, in which different products are produced under a capacity constraint, while only the mean and variance of the product demand are known. The problem aims to find a capacity allocation scheme to minimize the system cost of the worst-case among all possible demand distributions. When the total capacity is among certain ranges, the optimal solution has a closed-form. For other ranges, the optimal solution can be derived by solving one equation. The solution shows that there exist a number of threshold values for the capacity, below which some products are neglected (allocated with zero capacity). Besides, in the optimal solution, which products are prioritized for production is determined by the order of an index measured by the unit production cost, unit shortage cost, demand mean, and demand variance. For a special case where the cost structures for different products are identical, a closed-form solution is derived for any total capacity value. For this special case, the index order is simply determined by the coefficient of variation of each product demand. Sensitivity analysis shows that when the capacity is abundant, a larger demand variability of one product may cause a higher production quantity for this product; while if the capacity is tight, a larger demand variability cause a lower production quantity. For a set of test problems, the performance of the robust optimization solution is quite close to that of the stochastic optimization solution.
Suggested Citation
Yi Wang & Li Xiao & Xing-Gang Luo, 2023.
"On the optimal solution of a distributionally robust multi-product newsvendor problem,"
Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(12), pages 2578-2592, December.
Handle:
RePEc:taf:tjorxx:v:74:y:2023:i:12:p:2578-2592
DOI: 10.1080/01605682.2022.2163932
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:74:y:2023:i:12:p:2578-2592. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.