arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.3165cs.DScs.DM
收藏

多目标优化中的参考点法与逼近

Reference Point Methods and Approximation in Multicriteria Optimization

Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller

摘要:

运筹学的应用经常会带来多准则问题。多准则问题的数学研究主要围绕着帕累托最优解的集合,而在实践中,输出单个解的方法更普遍。在现实世界的多目标优化中,参考点方法被广泛使用,并且是此类方法的成功实例。参考点解是最接近目标空间中给定参考点的解。研究了参考点解的逼近问题。特别是,我们建立近似参考点的解决方案是多项式等价于近似的帕累托集。补充这些结果,我们展示了一些一般的算法技术,在单一的标准优化,它们可以被提升到参考点优化。特别是,我们解除动态规划和FPTAS之间的联系,以及不经意的LP舍入技术。后者适用,例如,集盖和几个机器排序问题。

英文摘要:

Operations research applications often pose multicriteria problems. Mathematical research on multicriteria problems predominantly revolves around the set of Pareto optimal solutions, while in practice, methods that output a single solution are more widespread. In real-world multicriteria optimization, reference point methods are widely used and successful examples of such methods. A reference point solution is the solution closest to a given reference point in the objective space. We study the approximation of reference point solutions. In particular, we establish that approximating reference point solutions is polynomially equivalent to approximating the Pareto set. Complementing these results, we show for a number of general algorithmic techniques in single criteria optimization how they can be lifted to reference point optimization. In particular, we lift the link between dynamic programming and FPTAS, as well as oblivious LP-rounding techniques. The latter applies, e.g., to Set Cover and several machine scheduling problems.

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

↑