arrow
返回

Optimal ordering for a probabilistic one-time discount

delete2015-08-01
delete8
PRE
AI
Y
Yaron Shaposhnik
Y
Yale T. Herer *
H
Hussein Naseraldin
DOI:10.1016/j.ejor.2015.02.020delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We develop a model for a one-time special purchasing opportunity where there is uncertainty with respect to the materialization of the discounted purchasing offer. Our model captures the phenomenon of an anticipated future event that may or may not lead to a discounted offer. We analyze the model and show that the optimal solution results from a tradeoff between preparing for the special offer and staying with the regular ordering policy. We quantify the tradeoff and find that the optimal solution is one of four intuitive policies. We present numerical illustrations that provide additional insights on the relationship between the different ordering policies. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Inventory
One-time discount
Special purchasing
Economic order quantity
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

B
Braude Academic College of Engineering
学者数:
274
论文数: 296
被引数: 0
T
Technion Israel Institute of Technology
学者数:
1.6W
论文数: 1.5W
被引数: 2.0W
引用论文

引用论文

err分享
err收藏
Magic Radio-Frequency Dressing of Nuclear Spins in High-Accuracy Optical Clocks
err2012-11-30
err0
errOAAI
errThomas Zanon-Willette; Emeric de Clercq; Ennio Arimondo
err分享
err收藏
err分享
err收藏
学者 查看更多内容