✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper a method for finding efficient solutions of a 0-1 Multiple Objective Linear (Nonlinear) programming.
📊
Key Findings & Data:In this method, for each feasible solution of 0-1 Multiple Objective Programming (0-1 MOP) problem, a Decision Making Unit (DMU) is introduced.
💡
Conclusion & Impact:Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
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.
🔖
Cite This Article
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