ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Kompromisprogrammering×Analytic Network Process (ANP med feedback og indbyrdes afhængigheder)×
FagområdeBeslutningstagningBeslutningstagning
FamilieMCDMMCDM
Oprindelsesår19731996
OphavspersonZeleny, M.Saaty, T. L.
TypeDistance-based — Lp metric to Pareto-optimal ideal (parametric p)Weight_Subjective (pairwise comparison, supermatrix, network structure)
Oprindelig kildeZeleny, 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
Aliasser
Relaterede88
Resumé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.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søgning Download slides

ScholarGateSammenlign metoder: COMPROMISE-PROGRAMMING · ANP. Hentet 2026-06-15 fra https://scholargate.app/da/compare