On the representation of the search region in multi-objective optimization
We describe the search region in multi-objective optimization by local upper bounds. The complexity of the description directly translates to generic solution methods. We enhance an earlier algorithm to compute this representation. We develop structural properties of this representation. From these we propose a new algorithm avoiding the filtering step of the former.
search region local upper bounds multiple objective programming generic solution approaches