Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/58708
Title: Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm
Authors: Bremicker, M.
Papalambros, P.Y.
Loh, H.T. 
Issue Date: 1990
Source: Bremicker, M.,Papalambros, P.Y.,Loh, H.T. (1990). Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm. Computers and Structures 37 (4) : 451-461. ScholarBank@NUS Repository.
Abstract: In practical structural optimization problems it is often desirable to obtain solutions where all or some of the design variables take their values from a given set of discrete values. As structural optimization problems typically include large models that are expensive to compute, one of the major demands for optimization algorithms is that the number of structural evaluations (i.e. calculations of deformations and stresses) that are needed during the iterative optimization process is as small as possible. In this article an algorithm is developed that meets this requirement, while finding global solutions for the mixed-discrete problem. The method is based on a combination of the well established branch and bound method with a sequential linearization procedure. Branch and bound is applied within a subproblem that is based on a linearization of the original problem. After a brief literature survey the method is described, followed by some comments on its algorithmic implementation. The algorithm is then applied to several structural optimization problems of different type and size to demonstrate its efficiency. All results are compared with solutions obtained by branch and bound. © 1990.
Source Title: Computers and Structures
URI: http://scholarbank.nus.edu.sg/handle/10635/58708
ISSN: 00457949
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

41
checked on Dec 15, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.