Abstract

This paper discusses the features of a new tool for engineering optimization problems. The new tool, Linearization Error Sequential Linear Programming (LESLP), includes an improved formulation of the well-established Sequential Linear Programming method. The LESLP algorithm is tested in seven structural optimization problems and two mathematical programming problems. The numerical efficiency, merits and limitations of LESLP are investigated in detail and compared with other general purpose optimization algorithms. Results indicate that LESLP is competitive with respect to other optimization algorithms published in the literature.

Full Text
Paper version not known

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 call

Disclaimer: 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.