ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Programmation de compromis×ANP×
DomainePrise de décisionPrise de décision
FamilleMCDMMCDM
Année d'origine19731996
Auteur d'origineZeleny, M.Saaty, T. L.
TypeDistance-based — Lp metric to Pareto-optimal ideal (parametric p)Weight_Subjective (pairwise comparison, supermatrix, network structure)
Source fondatriceZeleny, 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
Alias
Apparentées88
Résumé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.
ScholarGateJeu de données
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: COMPROMISE-PROGRAMMING · ANP. Consulté le 2026-06-15 sur https://scholargate.app/fr/compare