Next Article in Journal
Dynamic System Modeling Using Rules3 Induction Algorithm
Previous Article in Journal
Dynamical Control of Accuracy Using the Stochastic Arithmetic to Estimate Double and Improper Integrals
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 9
Issue 2
10.3390/mca9020147
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Method for Solving 0-1 Multiple Objective Programming Problem Using Data Envelopment Analysis Technique

by
G. R. Jahanshahloo
1,*,
F. Hossienzadeh Lotfi
2,
N. Shoja
2 and
G. Tohidi
2
1
Department of Mathematics, Teacher Training University, Tehran, lran
2
Department of Mathematics, Science & Research Branch, Islamic Azad University, Iran
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2004, 9(2), 147-156; https://doi.org/10.3390/mca9020147
Published: 1 August 2004
Versions Notes

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 04 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.
Keywords: 0-1 Multiple Objective Programming; Data Envelopment Analysis; Efficient Solution 0-1 Multiple Objective Programming; Data Envelopment Analysis; Efficient Solution

Share and Cite

MDPI and ACS Style

Jahanshahloo, G.R.; Lotfi, F.H.; Shoja, N.; Tohidi, G. A Method for Solving 0-1 Multiple Objective Programming Problem Using Data Envelopment Analysis Technique. Math. Comput. Appl. 2004, 9, 147-156. https://doi.org/10.3390/mca9020147

AMA Style

Jahanshahloo GR, Lotfi FH, Shoja N, Tohidi G. A Method for Solving 0-1 Multiple Objective Programming Problem Using Data Envelopment Analysis Technique. Mathematical and Computational Applications. 2004; 9(2):147-156. https://doi.org/10.3390/mca9020147

Chicago/Turabian Style

Jahanshahloo, G. R., F. Hossienzadeh Lotfi, N. Shoja, and G. Tohidi. 2004. "A Method for Solving 0-1 Multiple Objective Programming Problem Using Data Envelopment Analysis Technique" Mathematical and Computational Applications 9, no. 2: 147-156. https://doi.org/10.3390/mca9020147

Article Metrics

Back to TopTop