Abstract
A method is described for globally minimizing concave functions over convex sets whose defining constraints may be nonlinear. The algorithm generates linear programs whose solutions minimize the convex envelope of the original function over successively tighter polytopes enclosing the feasible region. The algorithm does not involve cuts of the feasible region, requires only simplex pivot operations and univariate search computations to be performed, allows the objective function to be lower semicontinuous and nonseparable, and is guaranteed to converge to the global solution. Computational aspects of the algorithm are discussed.
Similar content being viewed by others
References
J.E. Falk and K.L. Hoffman, “A successive underestimation method for concave minimization problems”,Mathematics of Operations Research 1 (1975) 251–259.
J.E. Falk and R.M. Soland, “An algorithm for separable nonconvex problems”,Management Science 15 (1969) 550–569.
R.E. Griffith and R.A. Stewart, “A nonlinear programming technique for the optimization of continuous processing systems”,Management Science 7 (1960) 379–392.
B. Gruenbaum,Convex polytopes (John Wiley and Sons, New York, 1967) 27.
R. Horst, “An algorithm for nonconvex programming problems”,Mathematical Programming 10 (1976) 312–321.
J.E. Kelley, Jr., “The cutting plane method for solving convex programs”,Journal of the Society for Industrial and Applied Mathematics 8 (1960) 703–712.
G.P. McCormick, “Algorithmic and computational aspects of the use of optimization methods in engineering design”,Computers and Structures 3 (1973) 1241–1249.
P.L. Olsen, “Solving a max-min problem in which the minimizer's decision constrains the maximizer”, Working Paper WP-16 (Institute for Defense analysis, Arlington, Virginia, 1975).
R.M. Soland, “An algorithm for separable nonconvex programming problems II: Nonconvex constraints”,Management Science 17 (1971) 759–773.
J. Stoer and C. Witzgall,Convexity and optimization (Springer, Berlin, 1970) 71.
G. Zoutendijk,Mathematical programming methods (North-Holland, Amsterdam, 1976) 295–301.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hoffman, K.L. A method for globally minimizing concave functions over convex sets. Mathematical Programming 20, 22–32 (1981). https://doi.org/10.1007/BF01589330
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01589330