Abstract
Convex programming with linear constraints represents a large class of optimization problems which have wide applications, such as linear programming, quadratic programming and some network flow programming problems. In this paper we discuss the artificial neural network approach based on the Lagrangian multiplier method (Lagrangian ANN) to it. The emphases of the paper are on analysing the defect of premature of the conventional Lagrangian ANN and giving a new modification to it in order to overcome its premature defect. We prove that this modified Lagrangian ANN can always give the optimal solution. Numerical simulations demonstrate the effectiveness of the proposed modification.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
