Range refinement and design selection in MDO-based multiobjective optimization

The main focus of this research is an application of multiobjective problems (MOPs) within a Multidisciplinary Design Optimization (MDO) environment. The primary goal is to extend the capabilities of the Multi-Objective Pareto Concurrent Subspace Optimization (MOPCSSO) method.; The previously developed MOPCSSO method is an extension of the Concurrent Subspace Optimization (CSSO) method. While both methodologies are executable for distributed optimization in an MDO environment, they fall short of capturing the entire Pareto frontier, thus failing to provide the decision-maker and/or designer with the entire range of acceptable solutions from which to choose. The method developed here first locates the Pareto endpoints, which will allow for the entire Pareto frontier to be explored. It should be noted that the MOPCSSO method locates solutions along both the convex and non-convex portions of the Pareto frontier, but fails to explore the entire space evenly. (Abstract shortened by UMI.)...