Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions

An interactive approach for solving bi-objective optimisation problems with multiple decision-makers in a context where the decisions are made via the strict majority voting rule is proposed. An adequate use of projection and decomposition techniques leads to a hierarchical algorithm in which the upper level is represented by a relaxed version of the bi-objective problem in the objective space. The feasibility of the partial consensus obtained in the upper (decision) level by the strict majority voting rule is tested in the lower (analysis) level of the algorithm. Some properties of the relaxed bi-objective problem allow that different preference structures of the decision-makers can be represented by appropriate multiobjective methods. The paper includes numerical examples that illustrate the characteristics of the approach proposed.51333334