An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set |
| |
| Affiliation: | 1. Department of Mechanical and Aerospace Engineering, University of Florida, Shalimar, FL USA;2. Air Force Research Laboratory, Space Vehicles Directorate, Kirtland AFB, NM USA;3. Department of Industrial and Systems Engineering, University of Florida, Shalimar, FL USA;4. Department of Mechanical Engineering, University of Iowa, Iowa City, IA USA;5. Air Force Research Laboratory, Munitions Directorate, Eglin AFB, FL USA;1. University of Bologna, Italy;2. University of Udine, Italy;3. University of Verona, Italy |
| |
| Abstract: | In this paper, we consider an optimization problem which aims to minimize a convex function over the weakly efficient set of a multiobjective programming problem. From a computational viewpoint, we may compromise our aim by getting an approximate solution of such a problem. To find an approximate solution, we propose an inner approximation method for such a problem. Furthermore, in order to enhance the efficiency of the solution method, we propose an inner approximation algorithm incorporating a branch and bound procedure. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
