单时期需求为“离散随机型存储问题”的研究  

An Analysis of the Issue of the Per-Duration Need for a Discrete-Time Stochastic Storage Problem

作　　者：芮世春[1] 陈忠卫[1] 

机构地区：[1]安徽财经大学管理学院,安徽蚌埠233030

出　　处：《运筹与管理》2008年第1期79-83,共5页Operations Research and Management Science

摘　　要：作者通过举例以及理论证明指出目前单时期需求为"离散随机型存储问题"的处理方法所存在的错误,在此基础上引入排队论,并在对单时期需求为"离散随机型存储问题"的盈利数学期望进行研究后,根据盈利期望最大化原则,推导并建立了最佳订购量公式。Through an example and also theoretical proof, the author points out the mistake existing in the current approach to the issue of the per-duration need for a discrete-time stochastic storage problem. Finally, queueing theory is introduced to address the problem, and the derivation of the optimal amount of order is given .

关 键 词：运筹学 单时期需求 离散随机变量 存储问题 排队论 

分 类 号：O227[理学—运筹学与控制论]