Submit Manuscript

Information Technology Journal

Year: 2010 | Volume: 9 | Issue: 8 | Page No.: 1615-1621
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 403

Search

Authors

Huaiqin Wu

Lijun He

Leijie Qin

Tao Feng

Rui Shi

Keywords

Research Article

Solving Interval Quadratic Program with Box Set Constraints in Engineering by a Projection Neural Network

Huaiqin Wu, Lijun He, Leijie Qin, Tao Feng and Rui Shi
In this study, the aim of the study is to present a new method to solve interval quadratic programming problem with box set constraints by using a projection neural network model. Based on the Saddle point theorem, the equilibrium point of the proposed neural network is proved to be the optimal solution of the interval quadratic optimization problem. By using fixed point theorem, the proof of the existence and uniqueness of equilibrium point for the proposed neural network is given. By constructing suitable Lyapunov functions, the asymptotic properties of the neural network are analyzed and a sufficient condition to ensure the global exponential stability for the unique equilibrium point, solution feasibility and solution optimality is presented. The transient behavior of the neural network is simulated and the validity of the result obtained is verified with an illustrative example.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *