Representing the nondominated set in multi-objective mixed-integer programs

2021-01-01
Doğan, Ilgın
Lokman, Banu
Köksalan, Murat
© 2021 Elsevier B.V.In this paper, we consider generating a representative subset of nondominated points at a prespecified precision in multi-objective mixed-integer programs (MOMIPs). The number of nondominated points grows exponentially with problem size and finding all nondominated points is typically hard in MOMIPs. Representing the nondominated set with a small subset of nondominated points is important for a decision maker to get an understanding of the layout of solutions. The shape and density of the nondominated points over the objective space may be critical in obtaining a set of solutions that represent the nondominated set well. We develop an exact algorithm that generates a representative set guaranteeing a prespecified precision. Our experiments on a variety of problems demonstrate that our algorithm outperforms existing approaches in terms of both the cardinality of the representative set and computation times.
Citation Formats
I. Doğan, B. Lokman, and M. Köksalan, “Representing the nondominated set in multi-objective mixed-integer programs,” pp. 0–0, 2021, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85106867663&origin=inward.