Abstract
In this article we present a new finite algorithm for globally minimizing a concave function over a compact polyhedron. The algorithm combines a branch and bound search with a new process called neighbor generation. It is guaranteed to find an exact, extreme point optimal solution, does not require the objective function to be separable or even analytically defined, requires no nonlinear computations, and requires no determinations of convex envelopes or underestimating functions. Linear programs are solved in the branch and bound search which do not grow in size and differ from one another in only one column of data. Some preliminary computational experience is also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benson, H. P. (1985), A Finite Algorithm for Concave Minimization over a Polyhedron,Naval Research Logistics Quarterly 32, 165–177.
Benson, H. P. and Erenguc, S. S. (1990), An Algorithm for Concave Integer Minimization over a Polyhedron,Naval Research Logistics 37, 515–525.
Heising-Goodman, C. D. (1981), A Survey of Methodology for the Global Minimization of Concave Functions Subject to Convex Constraints,Omega 9, 313–319.
Horst, R. (1976), An Algorithm for Nonconvex Programming Problems,Mathematical Programming 10, 312–321.
Horst, R. (1984), On the Global Minimization of Concave Functions: Introduction and Survey,Operations Research Spektrum 6, 195–205.
Horst, R. (1990), Deterministic Methods in Constrained Global Optimization: Some Recent Advances and New Fields of Application,Naval Research Logistics 37, 433–471.
Horst, R., Thoai, N. V., and Benson, H. P. (1991), Concave Minimization via Conical Partitions and Polyhedral Outer Approximation,Mathematical Programming 50, 259–274.
Horst, R. and Tuy, H. (1993),Global Optimization (Deterministic Approaches), 2nd Edition, Springer, Berlin.
International Business Machines (1990),Optimization Subroutine Library Guide and Reference, International Business Machines, Mechanicsburg, Pennsylvania.
Konno, H. (1976), Maximization of a Convex Quadratic Function Subject to Linear Constraints,Mathematical Programming 11, 117–127.
McCormick, G. P. (1972), Attempts to Calculate Global Solutions of Problems that may have Local Minima, in F. Lootsma (ed.),Numerical Methods for Nonlinear Optimization, Academic Press, London, 209–221.
Murty, K. G. (1968), Solving the Fixed Charge Problem by Ranking the Extreme Points,Operations Research 16, 268–279.
Murty, K. G. (1983),Linear Programming, Wiley, New York.
Pardalos, P. M. and Rosen, J. B. (1986), Methods for Global Concave Minimization: A Bibliographic Survey,SIAM Review 28, 367–379.
Pardalos, P. M. and Rosen, J. B. (1987),Constrained Global Optimization: Algorithms and Applications, Springer, Berlin.
Pardalos, P. M. and Schnitger, G. (1987), Checking Local Optimality in Constrained Quadratic Programming is NP-Hard,Operations Research Letters 7, 33–35.
Pegden, C. D. and Petersen, C. C. (1979), An Algorithm (GIPC2) for Solving Integer Programming Problems with Separable Nonlinear Objective Functions,Naval Research Logistics Quarterly 26, 595–609.
Rosen, J. B. (1983), Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain,Mathematics of Operations Research 8, 215–230.
Soland, R. M. (1974), Optimal Facility Location with Concave Costs,Operations Research 22, 373–382.
Tuy, H., Thieu, T. V. and Thai, N. Q. (1985), A Conical Algorithm for Globally Minimizating a Concave Function over a Closed, Convex Set,Mathematics of Operations Research 10, 498–514.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benson, H.P., Sayin, S. A finite concave minimization algorithm using branch and bound and neighbor generation. J Glob Optim 5, 1–14 (1994). https://doi.org/10.1007/BF01096999
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01096999