Comparison of Solution Approaches for A Bilevel Linear Programming Problem
Yazarlar (5)
Adana Alparslan Türkeş Bilim ve Teknoloji Üniversitesi, Türkiye
Türkiye
Dr. Öğr. Üyesi Murat YEŞİLKAYA
Tokat Gaziosmanpaşa Üniversitesi, Türkiye
Kırıkkale Üniversitesi, Türkiye
Kırıkkale Üniversitesi, Türkiye
| Bildiri Türü | Tebliğ/Bildiri |
| Bildiri Alt Türü | Tam Metin Olarak Yayınlanan Tebliğ (Uluslararası Kongre/Sempozyum) |
| Bildiri Niteliği | Alanında Hakemli Uluslararası Kongre/Sempozyum |
| Bildiri Dili | İngilizce |
| Kongre Adı | 15th International Conference on Applications of Fuzzy Systems, Soft Computing and Artificial Intelligence Tools |
| Kongre Tarihi | 26-08-2022 / |
| Basıldığı Ülke | Karadağ |
| Basıldığı Şehir | Budva |
| Özet |
| In this study, we consider solution approaches used to solve the proposed bilevel linear programming model for an Industrial Symbiosis network. We first solve this model with the well-known Karush-Kuch-Tucker (KKT) approach. However, transforming a bilevel programming model with the KKT approach increases the number of variables and constraints. For this reason, we use the fuzzy programming approach and the fuzzy goal programming approaches as alternatives to the KKT approach. Next, we compare the results of the KKT approach with these methods and examine the suitability of these approaches to solve our bilevel problem. Unlike previous studies, which claimed that fuzzy approaches mostly outperform the KKT approach, in our case, the best solution is obtained with the KKT approach. This is most probably because these approaches ignore the hierarchical nature of the problem. We believe that … |
| Anahtar Kelimeler |
