Skip to Content
  • Article
  • Open Access

1 August 2004

10 Pages

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

,
,
and
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.

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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.