✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In this paper a method for finding efficient solutions of a 0-1 Multiple Objective Linear (Nonlinear) programming.
📊
Temel Bulgular & Veri:In this method, for each feasible solution of 0-1 Multiple Objective Programming (0-1 MOP) problem, a Decision Making Unit (DMU) is introduced.
💡
Sonuç & Katkı:Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
In this paper a method for finding efficient solutions of a 0-1 Multiple Objective Linear (Nonlinear) programming. Problem using Data Envelopment Analysis (DEA) technique is proposed. In this method, for each feasible solution of 0-1 Multiple Objective Programming (0-1 MOP) problem, a Decision Making Unit (DMU) is introduced. Using the additive model, the relative efficiency of these DMUs is evaluated. Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.
🔖
Bu Makaleye Atıf Yap
JAHANSHAHLOO, G., HOSSIENZADEH, L., SHOJA, N., TOHIDI, G. (2004). A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique. Mathematical and Computational Applications, Cilt: 9 - Sayı: 2, 147–156. https://ajindex.com/articles/280340