arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.01883math.OC
收藏

双目标整数线性鲁棒优化的方法

Approaches for Biobjective Integer Linear Robust Optimization

Fabian Chlumsky-Harttmann, Marie Schmidt, Anita Schöbel

AI总结:

针对双目标混合整数线性鲁棒优化中鲁棒有效解求解方法不足的问题,本文提出三种结合二分搜索、optimization-pessimization 与对偶性的算法,并通过线性及整数线性实例验证其优劣。

摘要:

现实世界中的优化问题往往不仅涉及多个目标,还包含不确定参数。在这种情况下,目标是找到具有鲁棒性的 Pareto 最优解,即在不确定数据的所有可能实现下都保持合理良好的解。这类解在过去十年中已在许多论文中得到研究,并被称为鲁棒有效解。然而,用于寻找鲁棒有效解的求解方法仍然稀少。本文开发了三种算法,用于确定双目标混合整数线性鲁棒优化问题的鲁棒有效解。为此,我们借鉴多目标优化和鲁棒优化两方面的方法:用于双目标混合整数优化问题的二分搜索,以及来自(单目标)鲁棒优化的 optimization-pessimization(优化—悲观化)方法,该方法通过迭代添加场景来扩大不确定集。我们提出了两种将二分搜索与 optimization-pessimization 方法相结合的算法,以及一种利用对偶性的双目标线性鲁棒优化二分搜索方法。在此过程中,我们还得到了其他结果:将二分搜索从双目标线性问题扩展到双目标线性 minmax 问题,并将 optimization-pessimization 方法从单目标鲁棒优化问题推广到多目标鲁棒优化问题。我们在线性和整数线性实例上实现并测试了这三种算法,并讨论了它们各自的优势与不足。

英文摘要:

Real-world optimization problems often do not just involve multiple objectives but also uncertain parameters. In this case, the goal is to find Pareto-optimal solutions that are robust, i.e., reasonably good under all possible realizations of the uncertain data. Such solutions have been studied in many papers within the last ten years and are called robust efficient. However, solution methods for finding robust efficient solutions are scarce. In this paper, we develop three algorithms for determining robust efficient solutions to biobjective mixed-integer linear robust optimization problems. To this end, we draw from methods for both multiobjective optimization and robust optimization: dichotomic search for biobjective mixed-integer optimization problems and an optimization-pessimization approach from (single-objective) robust optimization, which iteratively adds scenarios and thereby increases the uncertainty set. We propose two algorithms that combine dichotomic search with the optimization-pessimization method as well as a dichotomic search method for biobjective linear robust optimization that exploits duality. On the way we derive some other results: We extend dichotomic search from biobjective linear problems to biobjective linear minmax problems and generalize the optimization-pessimization method from single-objective to multi-objective robust optimization problems. We implemented and tested the three algorithms on linear and integer linear instances and discuss their respective strengths and weaknesses.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑