Abstract
Abstract Optimal design of trusses requires the use of available discrete sections. The improved move limit method of sequential linear programming is a well established procedure for the optimal design of trusses. The branch and bound discrete linear programming method is effectively merged with sequential linear programming for the discrete optimal design of trusses. This algorithm is tested with a large number of examples to verify its usefulness for large problems with multiple loading conditions, the choice of a proper move limit factor, developing some approximate methods and possible extension to problems with frequency constraints. Two approximate methods are developed for the solution of the problem which gives results permitting the discrete solutions to be compared.
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.
