Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Компромиссное программирование× | ANP× | |
|---|---|---|
| Область | Принятие решений | Принятие решений |
| Семейство | MCDM | MCDM |
| Год появления≠ | 1973 | 1996 |
| Автор метода≠ | Zeleny, M. | Saaty, T. L. |
| Тип≠ | Distance-based — Lp metric to Pareto-optimal ideal (parametric p) | Weight_Subjective (pairwise comparison, supermatrix, network structure) |
| Основополагающий источник≠ | Zeleny, 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 |
| Другие названия | — | — |
| Связанные | 8 | 8 |
| Сводка≠ | 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. |
| ScholarGateНабор данных ↗ |
|
|