Category:Decomposition

From DDL Wiki

In the field of optimization, decomposition refers to approaches that solve optimization problems by replacing the original problem with a number of smaller sub-problems and then, in a coordinated manner, solving the sub-problems iteratively until it reaches a complete solution to the original problem. Often, decomposition approaches will exploit some special structure that exists in the optimization problem. Decomposition may be used to to improve efficiency, robustness, or convenience in solving the problem.

There are many decomposition techniques, including Dantzig-Wolfe decomposition, model coordination, goal coordination, bi-level integrated system synthesis (BLISS), analytical target cascading , and collaborative optimization.