পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| লেক্সিকোগ্রাফিক বেস্ট ওর্স্ট মেথড (Lexicographic Best Worst Method)× | বেস্ট-ওর্স্ট মেথড× | লেক্সিকোগ্রাফিক গোল প্রোগ্রামিং× | |
|---|---|---|---|
| ক্ষেত্র | সিদ্ধান্ত গ্রহণ | সিদ্ধান্ত গ্রহণ | সিদ্ধান্ত গ্রহণ |
| পরিবার | MCDM | MCDM | MCDM |
| উদ্ভবের বছর≠ | 2015 | 2015 | 1961 |
| প্রবর্তক≠ | Based on Rezaei's BWM framework and lexicographic optimization | Rezaei, J. | Abraham Charnes and William W. Cooper |
| ধরন≠ | Sequential best-worst comparisons with priority hierarchy | Pairwise comparison (best-to-others + others-to-worst vectors), LP | Sequential goal optimization with priority levels |
| মৌলিক উৎস≠ | Rezaei, 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. Omega DOI ↗ | Charnes, A., & Cooper, W. W. (1961). Management models and industrial applications of linear programming. Management Science, 8(1), 38-91. DOI ↗ |
| অপর নাম≠ | Lexicographic BWM | — | Lexicographic GP, LGP |
| সম্পর্কিত≠ | 4 | 8 | 2 |
| সারসংক্ষেপ≠ | Lexicographic 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. | BWM (Best-Worst Method) is a weight subjective multi-criteria decision-making (MCDM) method introduced by Rezaei, J. in 2015. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. | 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. |
| ScholarGateডেটাসেট ↗ |
|
|
|