ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Leksikografska metoda najboljeg i najgoreg×Slojevita metoda najboljeg i najgoreg (Stratified Best Worst Method)×
OblastDonošenje odlukaDonošenje odluka
PorodicaMCDMMCDM
Godina nastanka20152015
TvoracBased on Rezaei's BWM framework and lexicographic optimizationJafar Rezaei and collaborators
TipSequential best-worst comparisons with priority hierarchyHierarchical pairwise comparison with layer-wise best-worst
Temeljni izvorRezaei, J. (2015). Best-worst multi-criteria decision-making method: Some properties and a linear model. Journal of Cleaner Production, 229, 976-985. DOI ↗Rezaei, J. (2015). Best-worst multi-criteria decision-making method: Some properties and a linear model. Journal of Cleaner Production, 229, 976-985. DOI ↗
Drugi naziviLexicographic BWMStratified BWM
Srodne44
SažetakLexicographic BWM combines the strengths of the Best Worst Method with lexicographic (sequential) optimization. Instead of weighting all criteria simultaneously, it assigns criteria to priority levels, solves the BWM for the highest-priority criteria first, then solves for lower-priority criteria while keeping the higher-priority weights fixed. This ensures that higher-priority criteria are never sacrificed to improve lower-priority ones.Stratified BWM is an extension of the Best Worst Method that applies the BWM logic recursively across multiple hierarchical layers. Instead of weighting criteria at a single level, it identifies the best and worst criterion within each level of a hierarchy, then aggregates weights across levels. This enables more realistic modeling of complex decision problems with natural hierarchical structures.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Lexicographic Best Worst Method · Stratified Best Worst Method. Preuzeto 2026-06-19 sa https://scholargate.app/sr/compare