This paper presents a novel recurrent time continuous neural network model which performs nonlinear fractional optimization subject to interval constraints on each of the optimization variables. The network is proved to be complete in the sense that the set of optima of the objective function to be minimized with interval constraints coincides with the set of equilibria of the neural network. It is also shown that the network is primal and globally convergent in the sense that its trajectory cannot escape from the feasible region and will converge to an exact optimal solution for any initial point being chosen in the feasible interval region. Simulation results are given to demonstrate further the global convergence and good performance of the proposing neural network for nonlinear fractional programming problems with interval constraints.

+More

recurrent time continuous neural network model objective function optimal feasible region interval constraints nonlinear fractional programming problems equilibria optima of

Quan-Ju Zhang,Xiao Qing Lu,.A Recurrent Neural Network for Nonlinear Fractional Programming. 2012 (),.

Quan-Ju Zhang,Xiao Qing Lu,"A Recurrent Neural Network for Nonlinear Fractional Programming" 2012

Quan-Ju Zhang,Xiao Qing Lu,"A Recurrent Neural Network for Nonlinear Fractional Programming"