后悔
固定成本
库存控制
计算机科学
控制(管理)
产品(数学)
分布(数学)
期限(时间)
数学优化
运筹学
经济
微观经济学
数学
量子力学
几何学
机器学习
物理
数学分析
人工智能
作者
Mehdi Davoodi,Michael N. Katehakis,Jian Yang
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2022-03-21
卷期号:70 (3): 1560-1576
被引量:9
标识
DOI:10.1287/opre.2022.2272
摘要
When a new product has just been introduced or the economy has just entered a new phase, a firm is often at a loss as to what the underlying demand pattern has become let alone how best to respond to it. In “Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution,” Davoodi, Katehakis, and Yang faced off this challenging problem by tailoring ordering decisions to empirical distributions formed out of past demand observations. In the presence of fixed setup costs, however, an (s,S) policy optimal in the conventional known-distribution setting would take many periods for its long-term benefit to be realized. Therefore, a good online policy has to balance between letting ordering decisions settle for long periods and adjusting them frequently to take advantage of newly available information. When properly balanced, such policies could indeed achieve tight bounds for the performance measure of regret.
科研通智能强力驱动
Strongly Powered by AbleSci AI