Temat: optymalizacja Pareto - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On Pareto and Salukwadze Optimization Problems
Autorzy:: Kotarski, W.
Powiązania:: https://bibliotekanauki.pl/articles/911205.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: brzeg Pareto
optymalizacja
Pareto and Salukwadze optima
Pareto boundary
criterion space
scalarization
Opis:: In the paper, some problems of vector optimization are considered. Vector optimality is understood in the Pareto sense. Using the notion of Ponstein convexity, we formulate a 'scalarization' theorem. Two examples (vector optimization in IR^2 and an optimal-control problem for a parabolic equation with a vector performance index) are discussed. A Pareto boundary and a Salukwadze optimum are obtained for each of them. Additionally, for some vector optimization problems in IR^2, a criterion space is found. All calculations are performed with the use of Maple V. In the Appendix, a sketch of the proof of the main theorem on 'scalarization' is given.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 465-485
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

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ł

Informacja