Abstract
Three techniques are introduced to improve the performance of the SLP algorithm. These techniques are implemented through three stages. The first stage adaptively adjusts the constraint objectives based on the current design point. This process makes the linearized constraint equation close to the current design. The second stage computes the move limits which are to be imposed on the design variables. The calculation of move limits avoids the uncertainty of determination of these values. The third stage utilizes approximate efficient reanalysis methods to do inexact line search in the direction determined by linear programming (LP). The efficiency of locating the optimum solution is increased. Incorporating these techniques into the conventional sequential linear programming (SLP) algorithm enhances the efficiency and the robustness of the algorithm. Several examples are illustrated.
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.
