中文摘要：

为了研究零售商面向多个供应商订购一种产品时,如何根据各供应商给出的不同供应价格做出最优订购决策,根据成本优化理论,以订购成本和存储成本构成的总成本为目标函数,以订购时间和订购量为决策变量,构建了整数规划数学模型.分析了问题最优订购策略满足的性质,给出了动态规划递推公式.在递推公式的基础上设计了求解算法.根据计算复杂性理论,分析了算法的计算复杂性,证明了算法是多项式时间的.通过数值试验,进一步证明了算法可以在有效时间内帮助零售商优化成本、制定最优采购决策.

英文摘要：

Retailers must optimize ordering decisions according to the effects of differences in prices when ordering an item from multiple suppliers.Optimization can be difficult,so to improve profitability,an algorithm was developed using integer programming.It was formulated according to cost optimization theory.The objective function was the sum of order costs and holding costs with decision variables order time and quantities.Properties of the optimal order policy were proposed and the recurrence formula for dynamic programming given.Based on this recurrence formula,an algorithm was designed.The computational complexity of the algorithm was analyzed in terms of computational complexity theory.The formula was proven to be a polynomial time algorithm.A numerical test further illustrated that the algorithm can help the retailer optimize total costs while making order decisions quickly.