Matches in DBpedia 2016-04 for { ?s ?p "Benders decomposition (or Benders' decomposition) is a technique in mathematical programming 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. The technique is named after Jacques F. Benders.The strategy behind Benders decomposition can be summarized as divide-and-conquer."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Benders_decomposition comment "Benders decomposition (or Benders' decomposition) is a technique in mathematical programming 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. The technique is named after Jacques F. Benders.The strategy behind Benders decomposition can be summarized as divide-and-conquer.".
- Q3042795 comment "Benders decomposition (or Benders' decomposition) is a technique in mathematical programming 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. The technique is named after Jacques F. Benders.The strategy behind Benders decomposition can be summarized as divide-and-conquer.".