Benders decomposition (or Benders' decomposition) is a technique in mathematical optimization that allows the solution of very large linear programming problems that have a special block structure. This block structure often occurs in applications such as stochastic programming as the uncertainty is usually represented with scenarios.
Benders decomposition (or Benders' decomposition) is a technique in mathematical optimization that allows the solution of very large linear programming problems that have a special block structure. This block structure often occurs in applications such as stochastic programming as the uncertainty is usually represented with scenarios.
Source: Wikipedia "Benders decomposition" · CC BY-SA 4.0
Share this article: X · Bluesky