ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Metoda Leksykograficzna Najlepszy-Najgorszy×Programowanie celów leksykograficznych×
DziedzinaPodejmowanie decyzjiPodejmowanie decyzji
RodzinaMCDMMCDM
Rok powstania20151961
TwórcaBased on Rezaei's BWM framework and lexicographic optimizationAbraham Charnes and William W. Cooper
TypSequential best-worst comparisons with priority hierarchySequential goal optimization with priority levels
Źródło pierwotneRezaei, J. (2015). Best-worst multi-criteria decision-making method: Some properties and a linear model. Journal of Cleaner Production, 229, 976-985. DOI ↗Charnes, A., & Cooper, W. W. (1961). Management models and industrial applications of linear programming. Management Science, 8(1), 38-91. DOI ↗
Inne nazwyLexicographic BWMLexicographic GP, LGP
Pokrewne42
PodsumowanieLexicographic 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.Lexicographic Goal Programming (LGP) is a variant of goal programming introduced by Charnes and Cooper in the 1960s. It prioritizes multiple goals in a strict ordinal hierarchy, solving optimization problems sequentially: first achieve the highest-priority goal, then the second-highest while maintaining the first, and so on. This ensures that lower-priority goals are never pursued at the expense of higher-priority ones.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 3 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Lexicographic Best Worst Method · Lexicographic Goal Programming. Pobrano 2026-06-18 z https://scholargate.app/pl/compare