MCDMRankingcrisp

Compromise Programming — Lp-metric distance to ideal solution

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.

Apply with DecisionMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Zeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press DOI: 10.1007/978-3-642-80808-1

Related methods

Referenced by

ScholarGateCOMPROMISE-PROGRAMMING (Compromise Programming — Lp-metric distance to ideal solution). Retrieved 2026-06-04 from https://scholargate.app/en/decision-making/compromise-programming