Abstract
A convexification method is proposed for solving a class of global optimization problems with certain monotone properties. It is shown that this class of problems can be transformed into equivalent concave minimization problems using the proposed convexification schemes. An outer approximation method can then be used to find the global solution of the transformed problem. Applications to mixed-integer nonlinear programming problems arising in reliability optimization of complex systems are discussed and satisfactory numerical results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barhen, J., Protopopescu, V. and Reister, D. (1997), TRUST: A deterministic algorithm for global optimization, Science 276, 1094-1097.
Benson, H. P. (1996), Deterministic algorithm for constrained concave minimization: A unified critical survey, Naval Res. Logist. 43, 765-795.
Cvijovic, D. and Klinowski, J. (1995), Taboo search: An approach to the multiple minima problem, Science 267, 664-666.
Ge, R. (1990), A filled function method for finding a global minimizer of a function of several variables, Math. Program. 46, 191-204.
Hoffman, K. L. A. (1981), A method for globally minimizing concave functions over convex set, Math. Program. 20, 22-32.
Horst, R. (1990), Deterministic methods in constrained global optimization: Some recent advances and new fields of application, Naval Res. Logist. 37, 433-471.
Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, second ed., Springer-Verlag, Heidelberg.
Levy, A. V. and Montalvo, A. (1985), The tunneling algorithm for the global minimization of functions, SIAM J. Sci. & Stat. Comput. 6, 15-27.
Li, D. (1995), Zero duality gap for a class of nonconvex optimization problems, Journal of Optimization Theory and Applications 85, 309-324.
Li, D. (1996), Convexification of noninferior frontier, Journal of Optimization Theory and Applications 88, 177-196.
Li, D. and Sun, X. L. (2000), Local convexification of Lagrangian function in nonconvex optimization, Journal of Optimization Theory and Applications 104, 109-120.
Li, D., Sun, X. L., Biswal, M. P. and Gao, F. (2001), Convexification, concavification and montonization in global optimization, to appear in Annals of Operations Research.
Misra, K. B. and Sharma, U. (1991), An efficient algorithm to solve integer-programming problems arising in system-reliability design, IEEE Trans. Reliab. 40, 81-91.
Pardalos, P. M. and Rosen, J. B. (1987), Constrained Global Optimization: Algorithms and Applications, Springer, Berlin.
Rinnoy Kan, A. H. G. and Timmer, G. T. (1987), Stochastic global optimization methods, part I: Clustering methods, Math. Program. 39, 27-56.
Rinnoy Kan, A. H. G. and Timmer, G. T. (1987), Stochastic global optimization methods, part II: Multi-level methods, Math. Program. 39, 57-78.
Tillman, F. A., Hwuang C. L. and Kuo,W. (1980), Optimization of System Reliability, Marcel Dekker.
Tzafestas, S. G. (1980), Optimization of system reliability: A survey of problems and techniques, Int. J. Systems Sci. 11, 455-486.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sun, X.L., McKinnon, K. & Li, D. A convexification method for a class of global optimization problems with applications to reliability optimization. Journal of Global Optimization 21, 185–199 (2001). https://doi.org/10.1023/A:1011962605464
Issue Date:
DOI: https://doi.org/10.1023/A:1011962605464