The multi-item newsvendor problem with a budget constraint and fixed ordering costs

The multi-item newsvendor problem with a budget constraint and fixed ordering costs

0.00 Avg rating0 Votes
Article ID: iaor20011659
Country: United Kingdom
Volume: 51
Issue: 5
Start Page Number: 602
End Page Number: 608
Publication Date: May 2000
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: programming: dynamic
Abstract:

This paper deals with a multi-item newsvendor problem subject to a budget constraint on the total value of the replenishment quantities. Fixed costs for non-zero replenishments have been explicitly considered. Dynamic programming procedures are presented for two situations: (i) where the end item demand distributions are assumed known (illustrated for the case of normally distributed demand) and (ii) a distribution free approach where only the first two moments of the distributions are assumed known. In addition, simple and efficient heuristic algorithms have been developed. Computational experiments show that the performance of the heuristics is excellent based on a set of test problems.

Reviews

Required fields are marked *. Your email address will not be published.