Branch and probability bound methods in multi-objective optimization |
| |
Authors: | Antanas Z̆ilinskas Anatoly Zhigljavsky |
| |
Institution: | 1.Institute of Mathematics and Informatics,Vilnius University,Vilnius,Lithuania;2.Department of Mathematics,Cardiff University,Cardiff,UK |
| |
Abstract: | An approach to non-convex multi-objective optimization problems is considered where only the values of objective functions are required by the algorithm. The proposed approach is a generalization of the probabilistic branch-and-bound approach well applicable to complicated problems of single-objective global optimization. In the present paper the concept of probabilistic branch-and-bound based multi-objective optimization algorithms is discussed, and some illustrations are presented. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|