Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm
dc.contributor.author | Bremicker, M. | en_US |
dc.contributor.author | Papalambros, Panos Y. | en_US |
dc.contributor.author | Loh, Han Tong | en_US |
dc.date.accessioned | 2006-04-10T13:56:39Z | |
dc.date.available | 2006-04-10T13:56:39Z | |
dc.date.issued | 1990 | en_US |
dc.identifier.citation | Bremicker, M., Papalambros, P. Y., Loh, H. T. (1990)."Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm." Computers & Structures 37(4): 451-461. <http://hdl.handle.net/2027.42/28888> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V28-47XF41N-VB/2/99414aa0263b892c162fb33dbcd7add5 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/28888 | |
dc.description.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. | en_US |
dc.format.extent | 1163647 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Civil and Environmental Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, 2250 G. G. Brown, Ann Arbor, MI 48109-2125, U.S.A. | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, 2250 G. G. Brown, Ann Arbor, MI 48109-2125, U.S.A. | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, 2250 G. G. Brown, Ann Arbor, MI 48109-2125, U.S.A.; Department of Mechanical and Production Engineering, National University of Singapore, Singapore | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/28888/1/0000724.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0045-7949(90)90035-Z | en_US |
dc.identifier.source | Computers & Structures | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.