Optimal replenishment under price uncertainty

详细信息    查看全文

• 作者：Esther Mohr ^{mohr@bwl.uni-mannheim.de}
• 关键词：Inventory ; Online algorithms ; Minimax regret ; Competitive ratio ; Optimal search
• 刊名：European Journal of Operational Research
• 出版年：2017
• 出版时间：1 April 2017
• 年：2017
• 卷：258
• 期：1
• 页码：136-143
• 全文大小：723 K
• 卷排序：258

文摘

The replenishment problem is an extension of the online time series search problem. Reservation price algorithms can be adapted to the a-priori given information. We answer the question how much to order at the optimal point in time. The decision making of our algorithms is explored experimentally on crude oil prices. The price variation range is sufficient to solve the online replenishment problem optimally.