J.F. Benders devised an approach for exploiting the structure of mathematical programming problems with complicating
variables (variables which, when temporarily fixed, render the remaining optimization problem considerably more
tractable).The algorithm he proposed for finding the optimal value of this vector employs a cutting-plane approach for
building up adequate representations of...