Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Verified methods for computing Pareto sets: General algorithmic analysis

Boglárka G. TóthVladik Kreinovich — 2009

International Journal of Applied Mathematics and Computer Science

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...

Page 1

Download Results (CSV)