Decomposition methods
 Benders' decomposition Benders' decomposition (alternatively, Benders's decomposition; named after Jacques F. Benders) is a technique in mathematical programming that allows the solution of very large linear programming pro...
 Decomposition (computer science) Decomposition in computer science, also known as factoring, is breaking a complex problem or system into parts that are easier to conceive, understand, program, and maintain.There are different t... Decomposition (computer science) - Wikipedia
 Modular design Modular design, or "modularity in design", is a design approach that subdivides a system into smaller parts called modules or skids, that can be independently created and then used in different system... Modular design - Wikipedia
 Dantzig–Wolfe decomposition Dantzig–Wolfe decomposition is an algorithm for solving linear programming problems with special structure. It was originally developed by George Dantzig and Philip Wolfe and initially published in 1...
 Theory of two-level planning The Theory of two-level planning (alternatively, Kornai–Liptak decomposition) is a method that decomposes large problems of linear optimization into sub-problems. This decomposition simplifies the sol...
 Variable splitting In applied mathematics and computer science, variable splitting is a decomposition method that relaxes a set of constraints.When the variable x appears in two sets of constraints, it is possible ...