A method for generating all efficient solutions of 0-1 multi-objective linear programming problem

被引:12
作者
Jahanshahloo, GR
Hosseinzadeh, F
Shoja, N
Tohidi, G [1 ]
机构
[1] Islamic Azad Univ, Dept Math, Sci & Res Branch, Tehran, Iran
[2] Teacher Training Univ, Dept Math, Tehran, Iran
关键词
0-1 multi-objective linear programming; efficient solution;
D O I
10.1016/j.amc.2004.09.091
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, a method is proposed to find all efficient solutions of 0-1 multi-objective linear programming (MOLP) problem. These solutions are specified without generating all feasible solutions. Corresponding to a feasible solution of 0-1 MOLP problem, a vector is constructed which its components are the values of objective functions. The method consists of a one-stage algorithm. In each iteration of this algorithm, for obtaining some efficient solutions of 0-1 MOLP problem, a 0-1 single objective linear programming problem is solved. (c) 2004 Published by Elsevier Inc.
引用
收藏
页码:874 / 886
页数:13
相关论文
共 4 条
[1]   SOME MODELS FOR ESTIMATING TECHNICAL AND SCALE INEFFICIENCIES IN DATA ENVELOPMENT ANALYSIS [J].
BANKER, RD ;
CHARNES, A ;
COOPER, WW .
MANAGEMENT SCIENCE, 1984, 30 (09) :1078-1092
[2]   THEORY AND ALGORITHMS FOR LINEAR MULTIPLE OBJECTIVE PROGRAMS WITH ZERO-ONE VARIABLES [J].
BITRAN, GR .
MATHEMATICAL PROGRAMMING, 1979, 17 (03) :362-390
[3]   SOLVING ZERO-ONE MULTIPLE OBJECTIVE PROGRAMS THROUGH IMPLICIT ENUMERATION [J].
DECKRO, RF ;
WINKOFSKY, EP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (04) :362-374
[4]   Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs [J].
Liu, FHFL ;
Huang, CC ;
Yen, YL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (01) :51-68