Abstract
For a class of global optimization (maximization) problems, with a separable non-concave objective function and a linear constraint a computationally efficient heuristic has been developed.
The concave relaxation of a global optimization problem is introduced. An algorithm for solving this problem to optimality is presented. The optimal solution of the relaxation problem is shown to provide an upper bound for the optimal value of the objective function of the original global optimization problem. An easily checked sufficient optimality condition is formulated under which the optimal solution of concave relaxation problem is optimal for the corresponding non-concave problem. An heuristic algorithm for solving the considered global optimization problem is developed.
The considered global optimization problem models a wide class of optimal distribution of a unidimensional resource over subsystems to provide maximum total output in a multicomponent systems.
In the presented computational experiments the developed heuristic algorithm generated solutions, which either met optimality conditions or had objective function values with a negligible deviation from optimality (less than 1/10 of a percent over entire range of problems tested).
Similar content being viewed by others
References
Bazaraa, M.S., H.D. Sherali, and C.M. Shetty (1993). Nonlinear Programming. Theory and Algorithms. New York: John Wiley & Sons, Inc.
Dantzig, George B. (1963). Linear Programming and Extensions. Princeton, New Jersey: Princeton University Press.
Horst, Reiner, Panos M. Pardalos, and Nguen V. Thoai. (1995). Introduction to Global Optimization. Dordrecht: Kluwer Academic Publishers.
Horst, Reiner and Hoang Tuy (1996). Global Optimization, Deterministic Approach. Berlin: Springer.
Nemhauser, George L. and Laurence A Wolsey (1988). Integer and Combinatorial Optimization. New York: John Wiley & Sons, Inc.
Vavasis, Stephen A. (1995). “Complexity Issues in Global Optimization.” In Reiner Horst, Panos M. Pardalos (eds.), Handbook of Global Optimization. Dordrecht: KluwerAcademic Publishers, 27–41.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Babayev, D.A., Bell, G.I. An Optimization Problem with a Separable Non-Convex Objective Function and a Linear Constraint. Journal of Heuristics 7, 169–184 (2001). https://doi.org/10.1023/A:1009661804163
Issue Date:
DOI: https://doi.org/10.1023/A:1009661804163