Decomposition and Multilevel Optimization

Abstract

The resources required for the solution of an optimization problem typically increase with the dimensionality of the problem at a rate which is more than linear. That is, if we double the number of design variables in a problem, the cost of solution will typically more than double. Large problems may also require excessive computer memory allocations. For these reasons we often seek ways of breaking a large optimization problem into a series of smaller problems.