Benders Decomposition
Benders Decomposition, introduced by Jacques F. Benders in 1962, is a powerful algorithmic framework for solving large-scale mixed-integer programming (MIP) problems. It decomposes the problem into a master problem (controlling complicating variables) and subproblems (handling remaining variables), using cutting planes generated from subproblem dual information to iteratively tighten the master problem.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
- Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252. · DOI 10.1007/BF01386316
- Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10(4), 237-260. · DOI 10.1007/BF00934810
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.