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.