MCDMRankingcrisp
Compromise Programming — 到理想解的Lp度量距离
Compromise Programming（简称CP）是一种排序多准则决策（MCDM）方法，由Zeleny, M.于1973年提出。它将评分了多个准则的备选方案决策矩阵转化为结构化、可复现的结果。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Zeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press link ↗
如何引用本页
ScholarGate. (2026, June 2). Compromise Programming — Lp-metric distance to ideal solution. ScholarGate. https://scholargate.app/zh/decision-making/compromise-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 层次分析法决策↔ compare
- Analytic Network Process (ANP，具有反馈和相互依赖性的AHP)决策↔ compare
- 最佳-最差法 (Best-Worst Method)决策↔ compare
- 贝叶斯BWM决策↔ compare
- 标准差与相关系数客观赋权法决策↔ compare
- 标准差法 (Criterion Impact LOSs objective weighting method)决策↔ compare
- CIMAS (Criterion Impact MeAsurement System)决策↔ compare
- 准则重要性通过准则间相关性 (CRITIC)决策↔ compare