A Mathematical Programming Procedure For The Choice Problematic

In the framework of a Multicriterion Approach to the Choice Problematic, the kernel concept, which is highly inspired from that of the efficient set, is very often used. This concept generally leads to some difficulties related to its existence and uniqueness. This paper proposes a Mathematical Programming based Procedure which originates from an index matrix of valued relations of global preference or outranking in order to assist the selection of "dominating" alternative(s). (C) 2003 Elsevier B.V. All rights reserved.