Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3042795> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Q3042795 subject Q6426361.
- Q3042795 subject Q8367429.
- Q3042795 abstract "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. That is, in Benders decomposition, the variables of the original problem are divided into two subsets so that a first-stage master problem is solved over the first set of variables, and the values for the second set of variables are determined in a second-stage subproblem for a given first-stage solution. If the subproblem determines that the fixed first-stage decisions are in fact infeasible, then so-called Benders cuts are generated and added to the master problem, which is then re-solved until no cuts can be generated. Since Benders decomposition adds new constraints as it progresses towards a solution, the approach is called "row generation". In contrast, Dantzig–Wolfe decomposition uses "column generation".".
- Q3042795 wikiPageExternalLink ?PPN=GDZPPN001164228.
- Q3042795 wikiPageWikiLink Q141495.
- Q3042795 wikiPageWikiLink Q202843.
- Q3042795 wikiPageWikiLink Q2137023.
- Q3042795 wikiPageWikiLink Q2358222.
- Q3042795 wikiPageWikiLink Q3123181.
- Q3042795 wikiPageWikiLink Q4388617.
- Q3042795 wikiPageWikiLink Q5470696.
- Q3042795 wikiPageWikiLink Q6426361.
- Q3042795 wikiPageWikiLink Q7069670.
- Q3042795 wikiPageWikiLink Q7617831.
- Q3042795 wikiPageWikiLink Q8367429.
- Q3042795 wikiPageWikiLink Q884772.
- 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.".
- Q3042795 label "Benders decomposition".