期刊文献+

概率预期下在线报童问题的最小风险策略 被引量:9

The Minimal Risk Strategy of the Online Newsboy Problem Based on Probabilistic Forecast
原文传递
导出
摘要 报童问题是库存管理中一个基本模型。已有的报童模型主要利用均值-方差方法和期望效用目标方法进行风险的描述和度量。这些方法假设需求分布信息已知,而实际中需求分布信息往往难以完全刻画。本文使用概率预期作为刻画不完全需求分布信息的格式,基于在线风险补偿的思想,为需求分布信息不完全的报童问题建立了最小风险模型。使用该模型设计了最小风险策略,使报童可以根据自己设定的不同收益和未来概率预期选择最优订购量。 The newsboy problem has always been an important issue in inventory management.The exiting newsboy models describe and measure risk using Mean-Variance methodology and expected utility objective.These methods assume full knowledge of the demand probability distribution,however,in reality,it is often difficult to completely characterize the demand.This paper selects probability forecast to describe limited demand distribution,and constructs an online risk-reward model for the newsboy problem under probabilistic forecasts.Comparing with the existing studies,this model can help the newsboy choosing the minimal risk strategy with great flexibility,according to his own restrained reward and probabilistic forecast.
出处 《中国管理科学》 CSSCI 北大核心 2010年第6期131-137,共7页 Chinese Journal of Management Science
基金 国家自然科学基金面上项目(71071123) 国家自然科学基金重点项目(60736027)
关键词 报童问题 在线算法 风险 概率预期 newsboy problem online algorithm risk probabilistic forecast
  • 相关文献

参考文献24

  • 1Petruzzi, N. C. , Dada, M.. Pricing and newsvendor problem:A review with extension [J]. Operations Research,1999,47 (2) :183-149.
  • 2Silver, E. A. , Pyke, D. F. , Peterson, R. P.. Inventory management and production planning and scheduling [M]. New York : John Wiley, 1998.
  • 3Khouja,M.. The single-period (news-vendor) problem: Literature review and suggestions for future research[J]. Omega,1999,27:537-553.
  • 4Lau,A. H. L. ,Lau,H. S.. Maximizing the probability of achieving a target profit level in a two-product newsboy problem [J]. Decision Sciences, 1988, (19):392- 408.
  • 5Chen, F. , Federgruen, A.. Mean - ariance analysis of basic inventory models [R]. Columbia University, New York,2000.
  • 6Choi,T. M. ,Li,D. ,Yan, H.. Mean-variance analysis of a single supplier and retailer supply chain under a returns policy[J]. European Journal of Operational Research,2008,184 (1) :356-376.
  • 7Buzzacott,J. ,Yan, H. , Zhang, H.. Risk Analysis of Inventory Models with Forecast Updates [M]. Supply Chain Decisions with Forecast Updates, 2003.
  • 8Wu,J. ,Li,J. ,Wang,S. ,Cheng,T. C.E.. Mean-variance analysis of the newsvendor model with stockout cost [J]. Omega 2009: :724-730.
  • 9Eeckhoudt, L. , Gollier, C. , Schlesinger, H.. The risk averse (and prudent) newsboy [J]. Management Science, 1995,41 : 786 - 794.
  • 10Schweitzer, M. ,Cachon, G.. Decision bias in the news vendor problem with known demand distribution: ex perimental evidence [J]. Management Science, 2000 (46).

二级参考文献17

  • 1张金隆,王林,陈涛,曾宇容.连续生产模式下的不常用备件联合采购优化分析[J].中国管理科学,2004,12(5):58-62. 被引量:16
  • 2高农昌,何平.决策过程及最优决策时刻分析[J].中国管理科学,1995,3(4):53-58. 被引量:3
  • 3Schall L D. The lease - or - buy and asset acquisition decisions[J]. Journal of Finance, 1974,29:1203 - 1214.
  • 4Moller M H, Upton C W.Leasing, buying and the cost of capital services [ J ]. Journal of Finance, 1976,31: 761 -768.
  • 5Lippman S A, McCall J J.The economics of uncertainty:Selected topics and probabilistic methods[ C]. In K. J. Arrow and M. D. Intriligator, editors, Handbook of Mathematical Economics. North - Holland, 1981,1 (6): 211 - 284.
  • 6Mirman L J. Uncertainty and optimal consumption decisions[ J ]. Econometrica, 1971,39:179 - 185.
  • 7Zheng Z G,Fang K T.Bayesian procedure in time sequential sample plan[R].北京大学技术报告,1995.
  • 8Karp R. Online algorithms vessus offline algorithms. How much if it worth to know the future[J ]. Proc. IFIP 12th World computer Congress,992,1:416- 429.
  • 9Karlin A R, Manaees M S, Mc Geogh L, Owichi S. Competitive randomize algorithms for nonuniform problems[ J ]. Algorithmica, 1994,11 ( 1 ): 542 - 571 .'
  • 10Yaniv R E, Kaniel R, Linial N. Competitive optimal online leasing[J]. Algorithmica, 1999,25:116 - 140.

共引文献15

同被引文献100

引证文献9

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部