最小费用最大流新方法及Lingo实现

摘要

给出了利用矩阵的表示法来求解网络最小费用最大流的新方法．从先选取最小费用的第一条初始流，后面根据费用最小的原理，不断地增加初始点到终点有向流，直到无法增加为止，所得到的流即为最小费用最大流．通过举例介绍方法的应用，简单易懂．同时，给出Lingo代码进行验证其正确性．该方法对研究网络最小费用最大流有一定的推动作用．%This paper gives a new method to solve network minimum cost maxim the smallest chain of unit cost as the first initial stream is chosen. Then , according t cost, the chain from the starting point to the ending point is constantly in creased. It i um flow with Matrix. First, o the principle of minimum s the resulting flow of mini- mum cost maximum flow until the flow cannot be increased. It introduces the application of the method through examples, which is easy to understand. At the same time, it gives a Lingo code to verify its accuracy. The study of this paper plays a promoting role in network achieving the macimum flow with minimum cost. Key wards: maximum flow with minimum cost; Lingo ; unit cost ; capacity