Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems

DOI10.1007/S11081-006-6836-2zbMath1176.90423OpenAlexW1997941835MaRDI QIDQ833418

Layne T. Watson, Raphael T. Haftka

Publication date: 12 August 2009

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-006-6836-2

zbMATH Keywords

decompositionmixed integer programmingseparableglobal/local optimizationmultidisciplinary design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (3)

A classification of methods for distributed system optimization based on formulation structure ⋮ Efficiency for multiobjective multidisciplinary optimization problems with quasiseparable subproblems ⋮ Algebra of efficient sets for multiobjective complex systems

Cites Work

• Computational study of the nonhierarchical decomposition algorithm
• Polynomial response surface approximations for the multidisciplinary design optimization of a high speed civil transport
• Multidisciplinary design optimization with quasiseparable subsystems
• Decomposition Principle for Linear Programs

This page was built for publication: Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems