A capable neural network model for solving the maximum flow problem

作者:

Highlights:

摘要

This paper presents an optimization technique for solving a maximum flow problem arising in widespread applications in a variety of settings. On the basis of the Karush–Kuhn–Tucker (KKT) optimality conditions, a neural network model is constructed. The equilibrium point of the proposed neural network is then proved to be equivalent to the optimal solution of the original problem. It is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the maximum flow problem. Several illustrative examples are provided to show the feasibility and the efficiency of the proposed method in this paper.

论文关键词:92B20,90C20,37B25,Neural network,Maximum flow problem,Linear programming,Convergent,Stability

论文评审过程:Received 21 October 2011, Revised 24 February 2012, Available online 12 March 2012.

论文官网地址:https://doi.org/10.1016/j.cam.2012.03.001