摘要
在有时间约束且有多个供应商可供选择的前提下,讨论如何给出一个满意的供应商选择方案,确定参与的供应商及各自所供应的物资数量使总成本最小.对该问题在允许缺货前提条件下给出了单一物资需求和多物资需求的0-1混合整数规划模型及其求解算法,证明了算法的最优性,给出了算法的复杂度.
On condition that time restriction exists and many suppliers are available,this these discusses how to come up with a satisfying proposal on supplier selection and how to minimize the total cost by getting goods proportionally from different suppliers. On the basis of allowing goods shortage, the 0-1 mixinginte- ger programming models and algorithms to single goods demand and multiple goods demand are presented respectively. The algorithm＇s feasibility, optimality and complexity are deeply analyzed.
出处
《湘潭大学自然科学学报》
CAS
CSCD
北大核心
2009年第2期160-165,共6页
Natural Science Journal of Xiangtan University
基金
国家自然科学基金资助项目(10571147)
