A knapsack approach to solving the capacitated newsvendor problem Online publication date: Mon, 19-Jun-2023
by Pinyuan Shan; Layek Abdel-Malek
International Journal of Supply Chain and Inventory Management (IJSCIM), Vol. 4, No. 2, 2023
Abstract: The capacitated newsvendor problem continues to receive considerable attention. This is attributed to its wide range of applications. In the past few decades, researchers have proposed many solution methods. Nevertheless, these methods often require users to have knowledge in certain mathematical programming techniques or complex computer programs which are not easy to apply. To complement the existing literature in this area, this paper, which is a sister to the one that has been published in Springer Nature Operations Research Forum (Abdel-Malek et al., 2020) where a constructive approach utilising the known minimum cost network, is developed. In this work, we add to the previous methods by introducing a model that utilises the known knapsack problem to optimise its solution. Numerical experiments are conducted to compare the performance of some existing methods including those yielded by its sister paper to the proposed one. Managerial insights are also provided.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Supply Chain and Inventory Management (IJSCIM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook