We study a concept in multicriteria optimization called compromise solutions (introduced in 1973 by Yu [20]) and a generalized version of this, termed reference point solutions. Our main result shows the power of this concept: Approximating reference point solutions is polynomially equivalent to constructing an approximate Pareto set as in [16]. A reference point solution is the solution closes...

This paper deals with an interval-oriented approach to solve general interval constrained optimization problems. Generally, this type of problems has infinitely many compromise solutions. The aim of this approach is to obtain one of such solutions with higher accuracy and lower computational cost. The proposed algorithm is nothing but a different kind of branch and bound algorithm with multi-se...