Identifying preferred solutions to Multi‐Objective Binary Optimisation problems, with an application to the Multi‐Objective Knapsack Problem

In this paper we present a new framework for identifying preferred solutions to multi‐objective binary optimisation problems. We develop the necessary theory which leads to new formulations that integrate the decision space with the space of criterion weights. The advantage of this is that it allows for incorporating preferences directly within a unique binary optimisation problem which identifies efficient solutions and associated weights simultaneously. We discuss how preferences can be incorporated within the formulations and also describe how to accommodate the selection of weights when the identification of a unique solution is required. Our results can be used for designing interactive procedures for the solution of multi‐objective binary optimisation problems. We describe one such procedure for the multi‐objective multi‐dimensional binary knapsack formulation of the portfolio selection problem.