检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭贤 代文强[1] 蒋思琪 GUO Xian;DAI Wen-qiang;JIANG Si-qi(School of Management and Economics,University of Electronic Science and Technology of China,Chengdu 611731,China)
机构地区:[1]电子科技大学经济与管理学院,四川成都611731
出 处:《中国管理科学》2023年第1期200-205,共6页Chinese Journal of Management Science
基 金:国家自然科学基金资助项目(71871045);国家社会科学基金资助项目(17XGL011,18BGL108)。
摘 要:本文研究的是价格不确定且其下界随时间递增的原材料采购问题。在实际的原材料采购问题中,原材料的价格随时间的变动往往是不可预测的。之前的学者在研究价格不确定的占线采购问题时,假设价格在一个统一的常数上下界内,这没有考虑到经过时间的变化,价格的上下界可能也是变化的。本文提出并研究价格下界随时间递增的原材料占线采购问题。构建了相应数学模型,给出了相应的竞争采购策略并证明了竞争比,同时通过证明问题的匹配竞争比下界,说明给出的竞争采购策略是最优的,最后利用数值分析进一步说明竞争策略具有较好的竞争性能。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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.147.65