Fail-safe truss topology optimization
- 276 Downloads
The classical minimum compliance problem for truss topology optimization is generalized to accommodate for fail-safe requirements. Failure is modeled as either a complete damage of some predefined number of members or by degradation of the member areas. The considered problem is modeled as convex conic optimization problems by enumerating all possible damage scenarios. This results in problems with a generally large number of variables and constraints. A working-set algorithm based on solving a sequence of convex relaxations is proposed. The relaxations are obtained by temporarily removing most of the complicating constraints. Some of the violated constraints are re-introduced, the relaxation is resolved, and the process is repeated. The problems and the associated algorithm are applied to optimal design of two-dimensional truss structures revealing several properties of both the algorithm and the optimal designs. The working-set approach requires only a few relaxations to be solved for the considered examples. The numerical results indicate that the optimal topology can change significantly even if the damage is not severe.
KeywordsFail-safe optimal design Truss topology optimization Minimum compliance Semidefinite programming Second-order cone programming
The author would like to sincerely thank two anonymous reviewers for their knowledgeable comments and suggestions that significantly improved the manuscript in terms of contents and presentation.
The research presented in this manuscript is funded by Independent Research Fund Denmark through the research project Fail-Safe Structural Optimization (SELMA) with grant no. 7017-00084B.
Compliance with ethical standards
Conflict of interest
The author declares no conflict of interest.
- Bendsøe M, Sigmund O (2003) Topology optimization - theory, methods, and applications. Springer VerlagGoogle Scholar
- Cook RD, Malkus DS, Plesha ME, Witt RJ (2002) Concepts and applications of finite element analysis, 4th edn. Wiley, New YorkGoogle Scholar
- Dorn W, Gomory R, Greenberg H (1964) Automatic design of optimal structures. J de Mécanique 3:25–52Google Scholar
- Grant M, Boyd S (2008) Graph implementations for nonsmooth convex programs. In: Blondel V, Boyd S, Kimura H (eds) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences. Springer-Verlag Limited, pp 95– 110Google Scholar
- Grant M, Boyd S (2014) CVX: Matlab software for disciplined convex programming, version 2.1. http://cvxr.com/cvx
- Hemp W (1973) Optimum structures. Clarendon PressGoogle Scholar
- The Mathworks Inc (2018) MATLAB R2018a. Natick, MassachusettsGoogle Scholar