Generalized Benders' decomposition for topology optimization problems
From MaRDI portal
Publication:652657
DOI10.1007/s10898-010-9627-4zbMath1254.90129OpenAlexW2095003844WikidataQ56050708 ScholiaQ56050708MaRDI QIDQ652657
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9627-4
global optimizationstructural topology optimizationgeneralized Benders' decompositionouter-approximation
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Topological methods for optimization problems in solid mechanics (74P15) Compliance or weight optimization in solid mechanics (74P05)
Related Items
Hub location problems with price sensitive demands ⋮ Material interpolation schemes for unified topology and multi-material optimization ⋮ A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements ⋮ Stacking sequence and shape optimization of laminated composite plates via a level-set method ⋮ Solution of preemptive multi-objective network design problems applying Benders decomposition method ⋮ Truss topology optimization with discrete design variables by outer approximation ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ Towards a lifecycle oriented design of infrastructure by mathematical optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Partitioning procedures for solving mixed-variables programming problems
- Linear programming with matrix variables
- Solving mixed integer nonlinear programs by outer approximation
- A survey on Benders decomposition applied to fixed-charge network design problems
- Application of Benders' decomposition to power plant preventive maintenance scheduling
- Generalized Benders decomposition
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- Accelerating Benders Decomposition by Local Branching
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Structural Topology Optimization with Eigenvalues
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- The method of moving asymptotes—a new method for structural optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Robust Truss Topology Design via Semidefinite Programming
- Extension of the generalized benders' decomposition
- Semidefinite Programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
