In this work, we propose a segment-based representation for the upper bound of the non-dominated set in interval branch & bound solvers for biobjective non linear optimization. We ensure that every point over the upper line segments is dominated by at least one point in the feasible objective region. Segments are generated by linear envelopes of the image of feasible line segments. Finally, we show that the segment-based representation together with methods for generating upper line segments allows us to converge more quickly to the desired precision of the whole strategy. The code of our solver can be found in our git repository (https://github.com/INFPUCV/ibex-lib/tree/master/plugins/optim-mop).

在这项工作中，我们为区间支配和边界求解器中的非支配集的上限提出了基于分段的表示法，以实现双目标非线性优化。我们确保上段线段上的每个点都由可行目标区域中的至少一个点控制。通过可行线段图像的线性包络来生成线段。最后，我们证明了基于分段的表示方法以及生成上线分段的方法使我们能够更快地收敛到整个策略的期望精度。可以在我们的git存储库（https://github.com/INFPUCV/ibex-lib/tree/master/plugins/optim-mop）中找到求解器的代码。