Promethee V: Mcdm Problems With Segmentation Constraints

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 decisionmaker 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 partiaular (0–1) Linear Program in order to integrate these constraints. An application is described. An efficient microcomputer software is available from the authors.