- Tytuł:
- A method of approximating Pareto sets for assessments of implicit Pareto set elements
- Autorzy:
- Kaliszewski, I.
- Powiązania:
- https://bibliotekanauki.pl/articles/970402.pdf
- Data publikacji:
- 2007
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Tematy:
-
multiple criteria decision making
bi-criteria problems
Pareto set
efficiency
convex function approximation
sandwich algorithms - Opis:
- Deriving efficient variants in complex multiple criteria decision making problems requires optimization. This hampers greatly broad use of any multiple criteria decision making method. In multiple criteria decision making Pareto sets, i.e. sets of efficient vectors of criteria values corresponding to feasible decision alternatives, are of primal interest. Recently, methods have been proposed to calculate assessments for any implicit element of a Pareto set (i.e. element which has not been derived explicitly but has been designated in a form which allows its explicit derivation, if required) when a finite representation of the Pareto set is known. In that case calculating respective bounds involves only elementary operations on numbers and does not require optimization. In this paper the problem of approximating Pareto sets by finite representations which assure required tightness of bounds is considered for bicriteria decision making problems. Properties of a procedure to derive such representations and its numerical behavior are investigated.
- Źródło:
-
Control and Cybernetics; 2007, 36, 2; 367-381
0324-8569 - Pojawia się w:
- Control and Cybernetics
- Dostawca treści:
- Biblioteka Nauki
Artykuł