期刊名称：International Journal of Applied Mathematics and Computer Science
电子版ISSN：2083-8492
出版年度：2009
卷号：19
期号：3
出版社：De Gruyter Open
摘要：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.
Loading...
