主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2023, Vol. 31 ›› Issue (1): 200-205.doi: 10.16381/j.cnki.issn1003-207x.2020.0321

• Articles • Previous Articles    

Online Procurement Problem with Increasing Lower Bounds Price

GUO Xian, DAI Wen-qiang, JIANG Si-qi   

  1. School of Management and Economics, University of Electronic Science and Technology of China, Chengdu 611731, China
  • Received:2020-03-02 Revised:2020-09-02 Published:2023-02-09
  • Contact: 代文强 E-mail:wqdai@uestc.edu.cn

Abstract: Raw material procurement problem is analyzed. An import feature of this problem is the price is uncertain and distribution-free, but its lower bound is increasing over time. In the actual raw materials procurement practice,the varying price is often unpredictable. Previous scholars have studied the online procurement problem with uncertain prices, however, they usually assumed that the price will be within a uniform constant upper and lower bound, which did not take into account the vary of both two bounds will change over time. This paper proposes and studies an online procurement problem with the assumption that the lower bound for price will increase with time. We construct the mathematical model, which can be seen as a generalization of classical one-way trading problem. We present the corresponding competitive procurement strategy and prove its competition ratio performance. We also prove that the strategy is optimal by presenting a matched lower bound for competitive ratio. Finally, a numerical analysis is conducted to further illustrate the competition strategy presents a soupier competitive performance.

Key words: online; procurement; competitive strategy; competitive ratio

CLC Number: