Dergiler / Mathematical and Computational Applications / 2004 / Cilt: 9 - Sayı: 2

A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique

Sayfa
147–156
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

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

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (2)

  1. Ali and L. Seiford, Translation Invariance in Data Envelopment Analysis, Operations Research Letters 9,403-405, 1990. 2.R. D. Banker, A. Charnes and W.W. Cooper, Some Methods for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis, Management Science 30 (9), 1078-1092, 1984. 3.G. R. Bitran, Theory of algorithms for linear multiple objective programs with zero - onevariables, Mathematical Programming 17, 362-390, 1979. 4.A. Charnes, W.W. Cooper and E. Rhodes, Measuring the Efficiency of Decision Making Units, European Journal of Operational Research 2 (6), 429-444, 1978. 5.A. Charnes, W.W Cooper, B. Golany, L. Seiford and J.Stutz, Foundations of Data Envelopment Analysis and Pareto-Koopmans Empirical Production Function, Journal of Econometrics 30,91-107, 1985. 6.R. F. Deckro and E. P. Winkofsky, Solving zero-one multiple objective programs through implicit enumeration, European Journal of Operational Research 12, 362-374,1983. 7.T. Joro, P. Korhonen and J. Wallenius, Structural Comparison of Data Envelopment Analysis and Multiple Objective Linear Programming, Management Science 44(7), 962-970,1998. 8.F. H. F. Liu, C. C. Huang and Y. L. Yen, Using DEA to Obtain Efficient Solutions for Multi-Objective 0-1
  2. Linear Programs, European Journal of Operational Research 126, 51-68,2000.