Benders decomposition
id:
benders-decomposition-239-10957540
title:
Benders decomposition
text:
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 orig
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Benders_decomposition
date created:
date modified:
2024-03-29T14:30:30Z
main entity:
{"identifier":"Q3042795","url":"https://www.wikidata.org/entity/Q3042795"}
image:
fields total:
13
integrity:
13