Robust multi-market newsvendor models with interval demand data

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.

[1]  G. Monahan,et al.  Managing Fashion Goods Inventories: Dynamic Recourse for Retailers with Outlet Stores , 2003 .

[2]  K. Taaffe,et al.  Risk averse demand selection with all-or-nothing orders , 2009 .

[3]  C. W. Neale,et al.  Post-auditing capital projects , 1990 .

[4]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[5]  Joseph Geunes,et al.  Target market selection and marketing effort under uncertainty: The selective newsvendor , 2008, Eur. J. Oper. Res..

[6]  Harold D. Shane Mathematical Models for Economic and Political Advertising Campaigns , 1977, Oper. Res..

[7]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Inventory Theory , 2006, Oper. Res..

[8]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[9]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[10]  Masahiro Inuiguchi,et al.  Minimax regret solution to linear programming problems with an interval objective function , 1995 .

[11]  Fikri Karaesmen,et al.  Multi-product newsvendor problem with value-at-risk considerations , 2009 .

[12]  Frank R. Gulliver Post-project appraisals pay , 2007 .

[13]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[14]  Georgia Perakis,et al.  Regret in the Newsvendor Model with Partial Information , 2008, Oper. Res..

[15]  T. Payne,et al.  What Is the Right Supply Chain For Your Products , 2004 .

[16]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[17]  M. Laguna,et al.  A New Mixed Integer Formulation for the Maximum Regret Problem , 1998 .

[18]  Bin Zhang,et al.  Multi-product newsboy problem with limited capacity and outsourcing , 2010, Eur. J. Oper. Res..

[19]  Nallan C. Suresh,et al.  Production , Manufacturing and Logistics Would a risk-averse newsvendor order less at a higher selling price ? , 2009 .

[20]  Debjani Chakraborty,et al.  Production , Manufacturing and Logistics Incorporating one-way substitution policy into the newsboy problem with imprecise customer demand , 2009 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[23]  Baruch Keren,et al.  Production , Manufacturing and Logistics A benchmark solution for the risk-averse newsvendor problem , 2006 .

[24]  Manuel Laguna,et al.  A heuristic to minimax absolute regret for linear programs with interval objective function coefficients , 1999, Eur. J. Oper. Res..

[25]  Ismail Serdar Bakal,et al.  Analysis of order timing tradeoffs in multi-retailer supply systems , 2009 .

[26]  The design of the investment post‐audit process in large organisations: evidence from a survey , 2001 .

[27]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[28]  S. Webster,et al.  The Loss-Averse Newsvendor Problem , 2009 .

[29]  Kevin M. Taaffe,et al.  Identifying demand sources that minimize risk for a selective newsvendor , 2005, Proceedings of the Winter Simulation Conference, 2005..

[30]  Jun-ya Gotoh,et al.  Newsvendor solutions via conditional value-at-risk minimization , 2007, Eur. J. Oper. Res..

[31]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[32]  Xiande Zhao,et al.  Improving the supply chain performance: Use of forecasting models versus early order commitments , 2001 .

[33]  Paul H. Zipkin,et al.  Foundations of Inventory Management , 2000 .

[34]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[35]  Robert W. Grubbström,et al.  The Newsboy problem when customer demand is a compound renewal process , 2010, Eur. J. Oper. Res..

[36]  Guoqing Zhang,et al.  Optimal acquisition policy with quantity discounts and uncertain demands , 2009 .