A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, by using Data Envelopment Analysis (DEA) technique a method is proposed to find efficient solutions of 0-1 Multiple Objective Linear Programming (MOLP) problem. In this method from a feasible solution of 0-1 MOLP problem, a Decision Making Unit (DMU) without input vector is constructed in which output vector for DMU is the values of objective functions. The method consists of a two-stage algorithm. In the first stage, some efficient solutions are generated. In the second stage, the DMUs corresponding to the generated efficient solutions in the first stage together with the generated DMUs in the previous iterations are evaluated by using the additive model without input.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Shoja Nagi

  Islamic Azad University

• Jahanshahloo Golam

  Teacher Training University

• Hosseinzadeh Farhad

  Islamic Azad University

• Tohidi Ghasem

  Islamic Azad University

関連論文

• A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA

スポンサーリンク