The fractional minimal cost flow problem on network

被引：0
|
作者：
Cheng Xu
Xiao-ming Xu
Hai-feng Wang
机构：
[1] University of Shanghai for Science and Technology,School of Management
[2] Qingdao University,College of Mathematics
来源：
Optimization Letters | 2011年 / 5卷
关键词：
Fractional minimum cost flow problem; Check number; Dual problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A problem and a new algorithm are given for the linear fractional minimal cost flow problem on network. Using a new check number and combining the characteristic of network to extend the traditional theories of minimum cost flow problem, discussed the relation between it and its dual problem. Optimality conditions are derived and a Network Simplex Algorithm is proposed that leads to optimal solution assuming certain properties. Finally, an numerical example test is also developed.
引用
收藏
页码：307 / 317
页数：10
相关论文
共 50 条
12345