- Tytuł:
- Verified methods for computing Pareto sets: General algorithmic analysis
- Autorzy:
-
G.-Tóth, B.
Kreinovich, V. - Powiązania:
- https://bibliotekanauki.pl/articles/930124.pdf
- Data publikacji:
- 2009
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
optymalizacja wielocelowa
zbiór Pareto
multi-objective optimisation
Pareto set
verified computing - Opis:
- In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set-a set of all possible solutions x which cannot be improved in all categories (i.e., for which fj (x') fj (x) for all j and fj(x') > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between, say, cost and durability. We extend the general results about (verified) algorithmic computability of maxima locations to show that Pareto sets can also be computed.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 369-380
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł