Article ID: | iaor20133007 |
Volume: | 47 |
Issue: | 6 |
Start Page Number: | 783 |
End Page Number: | 794 |
Publication Date: | Jun 2013 |
Journal: | Structural and Multidisciplinary Optimization |
Authors: | Cheng Gengdong, Guo Xu, Ni Changhui, Du Zongliang |
Keywords: | optimization, programming: convex |
In the present paper, some extensions of the previous theoretical results about the symmetry properties of structural optimization problems are reported. It is found that generally the condition of convexity can be relaxed to quasi‐convexity in order to guarantee the existence of symmetry global optima. Furthermore, some new results about the symmetry properties of robust and discrete structural optimization problems are also presented. Numerous concrete examples illustrate the claims made in the present work explicitly.