需求区间型运输问题的求解算法  

An Algorithm for Solving the Transportation Problem With Interval of the Demands

作　　者：谢凡荣[1] 

机构地区：[1]南昌大学数学系,江西南昌330047

出　　处：《运筹与管理》2005年第1期23-27,共5页Operations Research and Management Science

摘　　要：为了便于建立与需求区间型运输问题有关的决策支持系统,本文给出了一个求解需求区间型运输问题的数值算法,证明了算法的理论依据,并举例说明算法的应用,该算法能求得问题的最优解,并具有易于编程实现、收敛性好等优点,大量数值实验表明该算法有较高的计算效率。For the convenience of decision-making supporting system related to the transportation problem with interval of the demands, a numerical algorithm is presented in this paper for solving the transportation problem with interval of the demands. The theory, on which the algorithm depends, is strictly proved. An example is given to demonstrate the use of the algorithm. The algorithm, which can find the optimal solution to the transportation problem with interval of the demands, has the merits to be easily programmed and of good convergence, and many numerical experiments verifies its great practicality and effectiveness.

关 键 词：运筹学 运输问题 需求区间型运输问题 典则型运输网络 最小费用最大流 

分 类 号：U113[交通运输工程] O224[理学—运筹学与控制论]