Article ID: | iaor201526603 |
Volume: | 22 |
Issue: | 5 |
Start Page Number: | 929 |
End Page Number: | 946 |
Publication Date: | Sep 2015 |
Journal: | International Transactions in Operational Research |
Authors: | Kamburowski Jerzy |
Keywords: | demand, distribution, programming: mathematical |
We consider the newsboy problem when the information about the probability distribution of random demand is limited to its support, mean, variance, and skewness. Sharp lower and upper bounds on the maximum expected profit are derived that lead to the corresponding optimal order quantities found under the worst‐case and best‐case scenarios. In addition, some special cases are solved by reducing the scope of knowledge about the demand distribution. Consequently, we generalize all results presented so far in the literature for the two scenarios, and present several new results. A numerical example illustrates the impact of available information on the quality of approximations. Extensions of our results are indicated.