Metodebevisregistrering

COMPROMISE-PROGRAMMING

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.

Sources recorded, not reviewed

Kilderegistrering

Citater kopieret ordret fra metodens kilderegistrering. Ingen påstandsniveauverifikation er udledt heraf.

Compromise Programming — Lp-metric distance to ideal solution

Taksonomisk metoderegistrering · mcdm / decision-making

Zeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press · URL

Åbn fuld metode

Kuraterede påstande

Påstande gemt i bevis-loggen, hver med sin egen vurdering.

Ingen kuraterede påstande endnu

Denne visning opfinder ikke en påstandsvurdering, når loggen ingen har.

Relaterede metoder

Genereret fra metodegrafen og vist som maskinelt foreslåede relationer — ingen bevispåstand er udledt.

Same method familyAHPmachine-suggested · Relational suggestion, not evidence.Same method familyANPmachine-suggested · Relational suggestion, not evidence.Same method familyBWMmachine-suggested · Relational suggestion, not evidence.Same method familyBWM-BAYESIANmachine-suggested · Relational suggestion, not evidence.Same method familyCCSDmachine-suggested · Relational suggestion, not evidence.Same method familyCILOSmachine-suggested · Relational suggestion, not evidence.Same method familyCIMASmachine-suggested · Relational suggestion, not evidence.Same method familyCRITICmachine-suggested · Relational suggestion, not evidence.