Abstract
This paper proposes a new method to solve general constrained optimization problem. The problem of finding the local optimal points of a nonlinear programming problem with equality and inequality constraints is considered by solving the ODE (i.e., ordinary differential equation) with an appropriate numerical procedure. Moreover, the rate of convergence to optimal points is quadratic. Some numerical result is given to show the efficiency of the proposed method.
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.
