求解最大利润流问题的一个算法

为了便于建立与最大利润流问题有关的决策支持系统，本给出了一个交易网络中求最大利润流的数值算法，证明了算法的理论依据，并举例了说明算法的应用。该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。

An Algorithm for Solving the Maximum Profit Flow Problem

For the convenience to build decision-making supporting system related to the maximum profit flow problem, a numerical algorithm is presented in this paper for seeking the maximum profit flow in the transaction network. The theory, which the algorithm depends on, is proved strictly. An example is given to demonstrate the use of the algorithm. The algorithm, which can find the optimal solution to the maximum profit flow problem, has the merits to be programmed easily and of good convergence, and many numerical experiments have verified its great practicalness and effectiveness.