Article ID: | iaor20133328 |
Volume: | 212 |
Issue: | 2 |
Start Page Number: | 361 |
End Page Number: | 373 |
Publication Date: | Jul 2011 |
Journal: | European Journal of Operational Research |
Authors: | Lin Jun, Ng Tsan Sheng |
Keywords: | minimax problem, newsboy problem |
We present a robust model for determining the optimal order quantity and market selection for short‐life‐cycle products in a single period, newsvendor setting. Due to limited information about demand distribution in particular for short‐life‐cycle products, stochastic modeling approaches may not be suitable. We propose the minimax regret multi‐market newsvendor model, where the demands are only known to be bounded within some given interval. In the basic version of the problem, a linear time solution method is developed. For the capacitated case, we establish some structural results to reduce the problem size, and then propose an approximation solution algorithm based on integer programming. Finally, we compare the performance of the proposed minimax regret model against the typical average‐case and worst‐case models. Our test results demonstrate that the proposed minimax regret model outperformed the average‐case and worst‐case models in terms of risk‐related criteria and mean profit, respectively.