Title
An efficient projection neural network for solving bilinear programming problems
Abstract
In this paper the application of projection neural network for solving bilinear programming problems (BLPs) is obtained. So far as we know, no study has yet been attempted for these problems via neural network. In fact, some interesting reformulations of BLP and mixed-integer bilinear programming problem (MIBLP) with a binary vector to linear complementarity problem (LCP) are given. Additionally, we show that the special type of MIBLP with a binary vector is equal to a quadratic program and on the other hand, it is equal to a mixed-integer linear program (MILP). Finally, we use a neural network to solve projection equation which has the same solution with LCP. Then, by presenting a Lyapunov function, we show that the proposed neural network is globally asymptotically stable. Illustrative examples are given to show the effectiveness and efficiency of our method.
Year
DOI
Venue
2015
10.1016/j.neucom.2015.05.003
Neurocomputing
Keywords
Field
DocType
Bilinear programming problem,Linear complementarity problem,Projection neural network,Globally asymptotically stable,Mixed-integer bilinear programming problem
Lyapunov function,Mathematical optimization,Linear programming,Linear complementarity problem,Quadratic programming,Artificial neural network,Mathematics,Binary number,Bilinear interpolation,Stability theory
Journal
Volume
Issue
ISSN
168
C
0925-2312
Citations 
PageRank 
References 
21
0.63
26
Authors
3
Name
Order
Citations
PageRank
Effati Sohrab127630.31
Amin Mansoori2585.31
Mohammad Eshaghnezhad3543.91