A decomposition algorithm for solving certain classes of production transportation problems with concave production cost

被引:1
|
作者
Kuno, T [1 ]
Utsunomiya, T [1 ]
机构
[1] UNIV TSUKUBA,INST INFORMAT SCI & ELECTR,TSUKUBA,IBARAKI 305,JAPAN
关键词
concave minimization; global optimization; production-transportation problem; resource allocation problem; dynamic programming;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses a method for solving two classes of production-transportation problems with concave production cost. By exploiting a special network structure both problems are reduced to a kind of resource allocation problem. It is shown that the resultant problem can be solved by using dynamic programming in time polynomial in the number of supply and demand points and the total demand.
引用
收藏
页码:67 / 80
页数:14
相关论文
共 50 条