Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Pareto set

Sortuj według:

Ogranicz wyniki do:

Verified methods for computing Pareto sets: General algorithmic analysis

100%

Tóth B., Kreinovich V.

International Journal of Applied Mathematics and Computer Science

2009

tom 19

nr 3

369-380

In many engineering problems, we face multi-objective optimization, with several objective functions f₁,...,fₙ. 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 $f_j(x') ≥ f_j(x)$ for all j and $f_j(x ) > f_j(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.

Ograniczanie wyników

1 International Journal of Applied Mathematics and Computer Science

1 Kreinovich V.

1 Tóth B.

1 2009

Wyniki wyszukiwania

Verified methods for computing Pareto sets: General algorithmic analysis