Algorithmic perspectives on problem formulations in MDO
Natalia M. Alexandrov, Robert W. Lewis Jr. · 8th Symposium on Multidisciplinary Analysis and Optimization · 2000
This work is concerned with an approach to formulating the multidisciplinary optimization (MDO) problem that reflects an algorithmic perspective on MDO problem solution. The algorithmic perspective focuses on formulating the problem in light of the abilities and inabilities of optimization algorithms, so that the resulting nonlinear programming problem can be solved reliably and efficiently by conventional optimization techniques. We propose a modular approach to formulating MDO problems that takes advantage of the problem structure, maximizes the autonomy of implementation, and allows for multiple easily interchangeable problem statements to be used depending on the available resources and the characteristics of the application problem. Key Words: Autonomy, complex system design, distributed analysis optimization, multidisciplinary analysis, multidisciplinary optimization, nonlinear programming, sensitivities, system synthesis Introduction The underlying theme of this and related p...