Truss topology optimization with discrete design variables by outer approximation
From MaRDI portal
Recommendations
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
- New branch and bound approaches for truss topology design with discrete areas
Cites work
- scientific article; zbMATH DE number 44702 (Why is no real title available?)
- scientific article; zbMATH DE number 1322737 (Why is no real title available?)
- scientific article; zbMATH DE number 2038815 (Why is no real title available?)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Applications of second-order cone programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Discrete material optimization of general composite shell structures
- Generalized Benders' decomposition for topology optimization problems
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Modelling topology optimization problems as linear mixed 0-1 programs
- New branch and bound approaches for truss topology design with discrete areas
- On some fundamental properties of structural topology optimization problems
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- On the validity of using small positive lower bounds on design variables in discrete topology optimization
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Robust Truss Topology Design via Semidefinite Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semidefinite Programming
- Solving mixed integer nonlinear programs by outer approximation
- Structural Topology Optimization with Eigenvalues
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
Cited in
(9)- Extended truss theory with simplex constraints
- Towards a lifecycle oriented design of infrastructure by mathematical optimization
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems
- Discrete multi-load truss sizing optimization: model analysis and computational experiments
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
This page was built for publication: Truss topology optimization with discrete design variables by outer approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486729)
