Combination between global and local methods for solving an optimization problem over the efficient set |
| |
| Institution: | 1. LMI, INSA Rouen, BP 8, 76131 Mont Saint Aignan, France;2. Department of Mathematics, University of Trier, 54286 Trier, Germany;1. Information and Control Institute, Hangzhou Dianzi University, Hangzhou 310018, PR China;2. Department of Chemical and Biomolecular Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;1. School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907, USA;2. Tianjin Key Lab of Indoor Air Environmental Quality Control, School of Environmental Science and Engineering, Tianjin University, Tianjin 300072, China;3. School of Civil Engineering, Dalian University of Technology, Dalian 116024, China;4. Department of Civil, Environmental, and Architectural Engineering, University of Colorado at Boulder, CO 80309, USA;1. Dept. of Civil Engineering, Bogazici University, Istanbul, Turkey;2. Manchester Centre for Civil and Construction Engineering, University of Manchester, Manchester, UK |
| |
| Abstract: | In this paper, we propose an algorithm for globally solving optimization problems over efficient sets. The algorithm is established based on a branch and bound scheme in which the bounding procedure is performed by using the well known weak duality theorem in Lagrange duality. A suitable combination of this algorithm with a local search procedure in d.c. optimization (named DCA) leads to a promising global algorithm, whose efficiency is more or less confirmed by computational experiments on a large set of test problems. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
