Benders' decomposition for the constrainedl1-problem
暂无分享,去创建一个
A constrainedl1-problem, involving linear functions only, is considered, and the application of the Benders decomposition method to the solution of the same is discussed. This approach, in principle, seems to be promising and is also applicable to the unconstrained case. Certain small illustrative examples are also presented.
[1] V. F. Dem'yanov,et al. Nondifferentiable Optimization , 1985 .
[2] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[3] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .
[4] Arthur M. Geoffrion. RELAXATION AND THE DUAL METHOD IN MATHEMATICAL PROGRAMMING , 1968 .