Robust solutions to the newsvendor problem under the perspective of competitive analysis

NISS2010 - 4th International Conference on New Trends in Information Science and Service Science

Volumn , Issue , 2010, Pages 424-429

  Ma, Wei Min ^a   Wang, Ke ^a  

^a TONGJI UNIVERSITY   (China)

Author keywords

Competitive analysis; Newsvendor problem; Risk; Robust solution

Indexed keywords

COMPETITIVE ANALYSIS; EFFECTIVE FRONTIER; EXPECTED PROFITS; MEAN VARIANCE; NEWSVENDOR PROBLEM; ONLINE ORDERS; OPTIMAL SOLUTIONS; PROBABILISTIC ANALYSIS; ROBUST PERFORMANCE; ROBUST SOLUTIONS;

INFORMATION SCIENCE; OPTIMIZATION; PROFITABILITY; RISK PERCEPTION;

UNCERTAINTY ANALYSIS;

EID: 77957757774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. F. Chen, and M. Parlar, "Value of a put option to the risk-averse newsvendor", IIE Transactions, 39 (5), pp.481-500, May 2007.
2. F. Chen, H. Yan, and L. Yao, "A Newsvendor Pricing Game", IEEE Transactions on Systems, Man, Cybernetics, Part A, 34 (4), pp.450-456, July 2004.
3. S. Choi and A. Ruszczynski, "A risk-averse newsvendor with law invariant coherent measures of risk", Operations Research Letters, 36, pp. 77-82, 2008.
4. M. Parlar and Z. Weng, "Balancing desirable but conflicting objectives in the newsvendor problem", IIE Transactions, 35 (2), pp.131-142, February 2003.
5. T.M. Within, "Inventory control and price theory", Management science, 2 (1), pp.61-68, 1955.
6. M. Khouja, "The single-period (news-vendor) problem: literature review and suggestions for future research", Omega, 27, pp.537-553, 1999.
7. I. Moon and S. Choi, "The distribution free newsboy problem with balking", Journal of Operational Research Society, 46, pp.537-542, 1995.
8. D. Reyniers, "A high-low search for a newsboy problem with delayed information feedback", Operations Research, 38 (5), pp.838-846, 1990.
9. A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, 1998.
10. R. Karp, "On-line algorithms versus offline algorithms: How Much is it Worth to Know the Future?" in Proc. IFIP 12th World Computer Congress, pp. 416-429, 1992.
11. R. El-Yaniv, A. Fiat, R.M. Karp, G. Turpin, "Competitive analysis of financial games", in Proc. 33rd IEEE FOCS, pp.327-333, 1992.
12. K. Wang, J.N.K. Liu, W.M. Ma, "To Wait or Not to Wait? Analysis for the Traveler's Waiting Problem with Incomplete Information", in Proceedings of the Fourth International Conference on Networked Computing and Advanced Information Management (NCM 2008), Vol. 2, pp. 726-731, 2008.
13. A.R. Karlin, "On the Performance of Competitive Algorithms in Practice", Lecture Notes in Computer Science, 1442, pp.373-384, 1998.
14. Y. Mo and T.P. Harrison, "A Conceptual Framework for Robust Supply Chain Design", in Supply Chain Optimization, J. Geunes and P.M. Pardalos, Eds. Springer, 2005, pp.243-263.
15. H. Sarimveis, P. Patrinos, CD. Tarantilis, and CT. Kiranoudis, "Dynamic modeling and control of supply chain systems: A review", Computers & Operations Research, 35 (11), pp.3530-3561, 2008.
16. S. Al-Binali, "A Risk-Reward Framework for the Competitive Analysis of Financial Games", Algorithmica, 25 (1), pp.99-115, 1999.