Selection among ranked projects under segmentation, policy and logical constraints

The paper proposes a method for project selection under a specific decision situation, where a final selection is guided by two aspects: (1) satisfaction of certain segmentation, policy and/or logical constraints, and (2) assurance that the individual evaluation of the projects is respected to the maximum degree. This approach is somewhat different than the usual portfolio optimization, where combinations of projects are compared without special concern on respecting the project's ranking. The entire process is implemented in two phases: the projects are first ranked, usually through a multicriteria approach. The obtained complete preorder of the projects is then used in an integer programming module in order to effectively drive the final selection that satisfies the segmentation and/or logical constraints. The innovative part of the proposed approach is the way it overcomes the well-known bias towards low cost projects which is caused by the knapsack formulation commonly used in the integer programming phase. Actually this is the main source of divergence between the final selection and the initial complete preorder of the projects. The proposed method improves an agreement between the final selection of projects obtained from the integer programming model and the ranking obtained from the multicriteria approach. (c) 2007 Elsevier B.V. All rights reserved.