ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

Kompormissio-ohjelmointi×ANP×
TieteenalaPäätöksentekoPäätöksenteko
MenetelmäperheMCDMMCDM
Syntyvuosi19731996
KehittäjäZeleny, M.Saaty, T. L.
TyyppiDistance-based — Lp metric to Pareto-optimal ideal (parametric p)Weight_Subjective (pairwise comparison, supermatrix, network structure)
AlkuperäislähdeZeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press link ↗Saaty, T. L. (1996). Decision Making with Dependence and Feedback: The Analytic Network Process. RWS Publications, Pittsburgh ISBN: 0-9620317-9-8
Rinnakkaisnimet
Liittyvät88
TiivistelmäCOMPROMISE-PROGRAMMING (Compromise Programming — Lp-metric distance to ideal solution) is a ranking multi-criteria decision-making (MCDM) method introduced by Zeleny, M. in 1973. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.ANP (Analytic Network Process (AHP with feedback and interdependences)) is a weight subjective multi-criteria decision-making (MCDM) method introduced by Saaty, T. L. in 1996. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
ScholarGateAineisto
  1. v1
  2. 1 Lähteet
  3. PUBLISHED
  1. v1
  2. 1 Lähteet
  3. PUBLISHED

Siirry hakuun Lataa diat

ScholarGateVertaile menetelmiä: COMPROMISE-PROGRAMMING · ANP. Haettu 2026-06-15 osoitteesta https://scholargate.app/fi/compare