Lin, Jun; Ng, Tsan Sheng Robust multi-market newsvendor models with interval demand data. (English) Zbl 1237.90016 Eur. J. Oper. Res. 212, No. 2, 361-373 (2011). Summary: 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. Cited in 15 Documents MSC: 90B05 Inventory, storage, reservoirs 90B50 Management decision making, including multiple objectives 90C59 Approximation methods and heuristics in mathematical programming Keywords:risk analysis; newsvendor problem; minimax regret; uncertainty modeling PDF BibTeX XML Cite \textit{J. Lin} and \textit{T. S. Ng}, Eur. J. Oper. Res. 212, No. 2, 361--373 (2011; Zbl 1237.90016) Full Text: DOI References: [1] Azzone, G.; Maccarrone, P., The design of the investment post-audit process in large organisations: Evidence from a survey, European Journal of Innovation Management, 4, 2, 73-87 (2001) [2] Bakal, I. S.; Geunes, J., Analysis of order timing tradeoffs in multi-retailer supply systems, International Journal of Production Research, 47, 11, 2841-2863 (2009) · Zbl 1198.90048 [3] Ben-Tal, A.; Nemirovski, A., Robust convex optimization, Mathematics of Operations Research, 23, 4, 765-805 (1998) · Zbl 0977.90052 [4] Ben-Tal, A.; Nemirovski, A., Robust solutions of uncertain linear programs, Operations Research, 25, 1, 1-13 (1999) · Zbl 0941.90053 [5] Ben-Tal, A.; Nemirovski, A., Robust solutions of linear programming problems contaminated with uncertain data, Mathematical Programming, 88, 3, 411-424 (2000) · Zbl 0964.90025 [6] Bertsimas, D.; Sim, M., The price of robustness, Operations Research, 52, 1, 35-53 (2004) · Zbl 1165.90565 [7] Bertsimas, D.; Thiele, A., A robust optimization approach to inventory theory, Operations Research, 54, 1, 150-168 (2006) · Zbl 1167.90314 [8] Boyd, S.; Vandenberghe, L., Convex Optimization (2004), Cambridge University Press: Cambridge University Press Cambridge, UK · Zbl 1058.90049 [10] Chahar, K.; Taaffe, K., Risk averse demand selection with all-or-nothing orders, Omega, 37, 5, 996-1006 (2009) [11] Daniels, R. L.; Kouvelis, P., Robust scheduling to hedge against processing time uncertainty in single-stage production, Management Science, 41, 2, 363-376 (1995) · Zbl 0832.90050 [12] Dutta, P.; Chakraborty, D., Incorporating one-way substitution policy into the newsboy problem with imprecise customer demand, European Journal of Operational Research, 200, 99-110 (2010) · Zbl 1188.90008 [13] El-Ghaoui, L.; Lebret, H., Robust solutions to least-square problems with uncertain data, SIAM Journal on Matrix Analysis and Applications, 18, 4, 1035-1064 (1997) · Zbl 0891.65039 [14] El-Ghaoui, L.; Oustry, F.; Lebret, H., Robust solutions to uncertain semidefinite programs, SIAM Journal on Optimization, 9, 1, 33-52 (1998) · Zbl 0960.93007 [15] Fisher, M. L., What is the right supply chain for your product? Harvard Business Review, 75, 2, 105-116 (1997) [16] Garey, M. R.; Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman · Zbl 0411.68039 [17] Gotoh, J.; Takano, Y., Newsvendor solutions via conditional value-at-risk minimization, European Journal of Operational Research, 179, 80-96 (2007) · Zbl 1275.90057 [18] Grubbstrom, R. W., The newsboy problem when customer demand is a compound renewal process, European Journal of Operational Research, 203, 134-142 (2010) · Zbl 1176.90020 [19] Gulliver, F. R., Post-project appraisals pay, Harvard Business Review, 65, 2, 128-132 (1987) [20] Inuiguchi, M.; Sakawa, M., Minimax regret solution to linear programming problems with an interval objective function, European Journal of Operational Research, 86, 3, 526-536 (1995) · Zbl 0914.90196 [22] Keren, B.; Pliskin, J. S., A benchmark solution for the risk-averse newsvendor problem, European Journal of Operational Research, 174, 1643-1650 (2006) · Zbl 1103.90305 [23] Mausser, H. E.; Laguna, M., A new mixed integer formulation for the maximum regret problem, International Transactions in Operational Research, 5, 5, 389-403 (1998) [24] Mausser, H. E.; Laguna, M., A heuristic to minimax absolute regret for linear programs with interval objective function coefficients, European Journal of Operational Research, 117, 1, 157-174 (1998) · Zbl 0998.90058 [25] Neale, C. W.; Holmes, D. E.A., Post-auditing capital projects, Long Range Planning, 23, 88-96 (1990) [26] Ozler, A.; Tan, B.; Karaesmen, F., Multi-product newsvendor problem with value-at-risk considerations, International Journal of Production Economics, 117, 2, 244-255 (2009) [27] Perakis, G.; Roels, G., Regret in the newsvendor model with partial information, Operations Research, 56, 1, 188-203 (2008) · Zbl 1167.90350 [28] Petruzzi, N. C.; Monahan, G. E., Managing fashion goods inventories: dynamic recourse for retailers with outlet stores, IIE Transactions, 35, 11, 1033-1047 (2003) [29] Soyster, A. L., Convex Programming with set-inclusive constraints and applications to inexact linear programming, Operations Research, 21, 5, 1154-1157 (1973) · Zbl 0266.90046 [31] Taaffe, K.; Geunes, J.; Romeijn, H. E., Target market selection and marketing effort under uncertainty: The selective newsvendor, European Journal of Operational Research, 189, 3, 987-1003 (2008) · Zbl 1142.91498 [32] Wang, C. X.; Webster, S., The loss-averse newsvendor problem, Omega, 37, 1, 93-105 (2009) [33] Wang, C. X.; Webster, S.; Suresh, N. C., Would a risk-averse newsvendor order less at a higher selling price?, European Journal of Operational Research, 196, 544-553 (2009) · Zbl 1163.90568 [34] Zhang, B.; Du, S., Multi-product newsboy problem with limited capacity and outsourcing, European Journal of Operational Research, 202, 107-113 (2010) · Zbl 1173.90397 [35] Zhang, G.; Ma, L., Optimal acquisition policy with quantity discounts and uncertain demands, International Journal of Production Research, 47, 9, 2409-2425 (2007) · Zbl 1171.90388 [36] Zhao, X.; Xie, J.; Lau, R. S.M., Improving the supply chain performance: use of forecasting models versus early order commitments, International Journal of Production Research, 39, 17, 3923-3939 (2001) · Zbl 1037.90524 [37] Zipkin, P. H., Foundations of Inventory Management (2000), McGraw-Hill: McGraw-Hill Boston, MA · Zbl 1370.90005 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.