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

doi:10.1016/j.amc.2004.09.091

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

2005-10-01

12

PRE

AI

G

G.R. Jahanshahloo

F

Farhad Hosseinzadeh Lotfı

DOI：10.1016/j.amc.2004.09.091

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

0-1 multi-objective linear programming

efficient solution

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

Abstract

Journal

Organization