A general framework for providing interval representations of Pareto optimal outcomes for large-scale bi- and tri-criteria MIP problems

Grzegorz Filcek, Janusz Miroforidis

The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarizat…