Constructing an outranking relation with ORESTE

Hugo Pastijn; Jan Leysen

doi:10.1016/0895-7177(89)90367-1

Constructing an outranking relation with ORESTE

Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung

Abstract

According to k criteria, m alternative actions are ranked. For each criterion a complete weak order is defined on the set of actions. The relative importance of the criteria is also defined by a complete weak order. We discuss an adaptation of the ORESTE method for the construction of an outranking relation on the set of actions. We emphasize the interpretation of the parameters and the properties of the obtained outranking relation.

Originalsprache	Englisch
Seiten (von - bis)	1255-1268
Seitenumfang	14
Fachzeitschrift	Mathematical and Computer Modelling
Jahrgang	12
Ausgabenummer	10-11
DOIs	https://doi.org/10.1016/0895-7177(89)90367-1
Publikationsstatus	Veröffentlicht - 1989

Zugriff auf Dokument

10.1016/0895-7177(89)90367-1

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@article{2f6410ca67574ddb825e1257ac78ade4,

title = "Constructing an outranking relation with ORESTE",

abstract = "According to k criteria, m alternative actions are ranked. For each criterion a complete weak order is defined on the set of actions. The relative importance of the criteria is also defined by a complete weak order. We discuss an adaptation of the ORESTE method for the construction of an outranking relation on the set of actions. We emphasize the interpretation of the parameters and the properties of the obtained outranking relation.",

author = "Hugo Pastijn and Jan Leysen",

year = "1989",

doi = "10.1016/0895-7177(89)90367-1",

language = "English",

volume = "12",

pages = "1255--1268",

journal = "Mathematical and Computer Modelling",

issn = "0895-7177",

number = "10-11",

}

TY - JOUR

T1 - Constructing an outranking relation with ORESTE

AU - Pastijn, Hugo

AU - Leysen, Jan

PY - 1989

Y1 - 1989

N2 - According to k criteria, m alternative actions are ranked. For each criterion a complete weak order is defined on the set of actions. The relative importance of the criteria is also defined by a complete weak order. We discuss an adaptation of the ORESTE method for the construction of an outranking relation on the set of actions. We emphasize the interpretation of the parameters and the properties of the obtained outranking relation.

AB - According to k criteria, m alternative actions are ranked. For each criterion a complete weak order is defined on the set of actions. The relative importance of the criteria is also defined by a complete weak order. We discuss an adaptation of the ORESTE method for the construction of an outranking relation on the set of actions. We emphasize the interpretation of the parameters and the properties of the obtained outranking relation.

UR - http://www.scopus.com/inward/record.url?scp=0024886420&partnerID=8YFLogxK

U2 - 10.1016/0895-7177(89)90367-1

DO - 10.1016/0895-7177(89)90367-1

M3 - Article

AN - SCOPUS:0024886420

SN - 0895-7177

VL - 12

SP - 1255

EP - 1268

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

IS - 10-11

ER -

Constructing an outranking relation with ORESTE

Abstract

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren