2004•Mathematical and Computational ApplicationsOpen access

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

G.R. Jahanshahloo, Farhad Hosseinzadeh Lotfı, Naghi Shoja, Ghasem Tohidi

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.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Data envelopment analysis, Mathematical optimization, Linear programming, Nonlinear programming, Computer science, Efficiency, Unit (ring theory), Nonlinear system