Separation
From DDL Wiki
Jwh2 (Talk | contribs)
(New page: ==Definition== Separation is an optimization approach that replaces a design optimization problem with a set of subproblems. It then solves each subproblem once in order to generate ...)
Newer edit →
Revision as of 16:12, 17 December 2008
Definition
Separation is an optimization approach that replaces a design optimization problem with a set of subproblems. It then solves each subproblem once in order to generate a feasible solution. Ideally, separation produces an optimal solution to the original problem. However, not all separations do.
The concept of separation is similar to the idea of decomposition. Both replace a large design optimization problem with a set of subproblems. In a typical decomposition approach, a second-level problem must be solved to coordinate the subproblem solutions in an iterative manner. Separation does not require this iteration.
A separation may use a simple sequence of subproblems, a set of subproblems that are solved in parallel, or a more complex network of subproblems.
A separation provides a way to reformulate a design optimization problems and find a good solution. It is important to carefully design the separation to provide a valuable solution, and the quality of the solution that results depends upon the constraints and objectives used in the subproblems. A separation may be able to find a feasible solution in less time.
References
- Karimian, Peyman, and Jeffrey W. Herrmann, [http://link.aip.org/link/?JMD/131/011007 Separating Design Optimization Problems
into Decision-Based Design Processes], Journal of Mechanical Design, Volume 131, Issue 1, 011007, January 2009.
