PROMETHEE V: MCDM problems with segmentation constraints

PROMETHEE V: MCDM problems with segmentation constraints

0.00 Avg rating0 Votes
Article ID: iaor19921830
Country: Canada
Volume: 30
Issue: 2
Start Page Number: 85
End Page Number: 96
Publication Date: May 1992
Journal: INFOR
Authors: ,
Keywords: decision, location
Abstract:

Multicriteria problems with a finite set of possible alternatives grouped in clusters or segments are considered. The problem is to select a subset of alternatives evaluated by several criteria and submitted to segmentation constraints between and within the clusters. The basic PROMETHEE-GAIA procedure for multicriteria problems is first briefly recalled. This procedure provides the decision-maker with good compromises as well as an interesting visual descriptive view of the multicriteria problem; but, up to now, it doesn’t take the segmentation constraints into account. PROMETHEE V is combining the results obtained by the basic PROMETHEE-GAIA procedure and a particular (0-1) Linear Program in order to integrate these constraints. An application is described. An efficient microcomputer software is available from the authors.

Reviews

Required fields are marked *. Your email address will not be published.