Benders's decomposition A method of simplifying the maximization (or minimization) of a semi-linear
objective function of the form
c′x +
g(y), subject to constraints such as
Ax + h(y)≤
b, where g and h are known functions,
A is a known
matrix,
b and
c are known
vectors, and
c′ is the transpose of
c.
No comments:
Post a Comment