Year-end Sale % OFF 
Abstract
AbstractThe problem of steel frames optimal design, when it is written in mathematical programming form, gives a moderate number of unknowns and a huge number of constraints. A typical frame has about 50 unknowns and 20000 constraints. The large number of constraints, which are complex functions of many parameters, represents a problem for most non‐linear programming solvers. In order to reduce the number of constraints, we developed a method, which eliminates a large portion of constraints without their costly evaluation. The method is based on the problem specific constraints organization, where the constraints are organized into sets. It turns out that we can remove individual constraints from a set by simply comparing constraint parameters.
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 callMore From: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
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.
