Large scale optimization and the relaxation method
暂无分享,去创建一个
An algorithm is given for the maximization of any function of many variables which may be described as the envelope of a family of linear functions. It is shown how the large-scale problems of linear programming to which various decomposition schemes apply can be posed in this way. Computational experience with some of these problems is reviewed.
[1] I. J. Schoenberg,et al. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.
[2] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..