Name
Abstract | ||
|---|---|---|
Due to the growing interest in approximation for multiobjective optimization problems (MOPs), a theoretical framework for defining and classifying sets representing or approximating solution sets for MOPs is developed. The concept of tolerance function is proposed as a tool for modeling representation quality. This notion leads to the extension of the traditional dominance relation to $$t\\hbox {-}$$t-dominance. Two types of sets representing the solution sets are defined: covers and approximations. Their properties are examined in a broader context of multiple solution sets, multiple cones, and multiple quality measures. Applications to complex MOPs are included. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10898-016-0426-4 | J. Global Optimization |
Keywords | Field | DocType |
Multiobjective optimization,Nondominated set,Pareto set,Approximation,Cones,Tolerance function | Mathematical optimization,Dominance relation,Multi-objective optimization,Solution set,Multiobjective optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
67 | 3 | 0925-5001 |
Citations | PageRank | References |
5 | 0.43 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Vanderpooten | 1 | 1153 | 74.66 |
| Lakmali Weerasena | 2 | 5 | 0.43 |
| Margaret M. Wiecek | 3 | 213 | 22.90 |