摘要
经典的运输问题是一个线性规划模型。本文讨论了把产地运输到销地的物资数量限制为非负整数时的运输问题,从理论上证明了这种有整数限制的运输问题模型可以转化为相应的线性规划模型来求解,有效地降低了计算难度。
The classical transportation problem is a linear programming model. In the paper, we will solve the transportation problem in which transport quantity is restricted as non-negative integer number. In theory, we can prove that the linear integer programming model can change into the linear programming model.
出处
《运筹与管理》
CSCD
2008年第4期12-15,共4页
Operations Research and Management Science
基金
国家自然科学基金资助项目(70672063)
国家哲学社会科学创新基地资助
黑龙江省博士后基金项目(LBH-Z07118)
关键词
运输问题
线性规划
线性整数规划
整数限制
transportation problem
linear programming
linear integer programming
integer restriction
