Benders' decomposition

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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 problems that have a special block structure. This structure often occurs in applications such as stochastic programming.

As it progresses towards a solution, Benders' decomposition adds new constraints , so the approach is called "row generation". In contrast, Dantzig–Wolfe decomposition uses "column generation".

See also[edit]

  • FortSP solver uses Benders' decomposition for solving stochastic programming problems


  • J. F. Benders, "Partitioning procedures for solving mixed-variables programming problems," Numer. Math. 4, 3 (Sept. 1962), pp. 238–252. [1]