Approximating biobjective minimization problems using general ordering cones

Author:

Herzel Arne,Helfrich Stephan,Ruzika Stefan,Thielen ClemensORCID

Abstract

AbstractThis article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously considering $$\alpha $$ α -approximations for all closed convex ordering cones of a fixed inner angle $$\gamma \in \left[ \frac{\pi }{2}, \pi \right] $$ γ π 2 , π , an approximation guarantee between $$\alpha $$ α and $$2 \alpha $$ 2 α is achieved, which depends continuously on $$\gamma $$ γ . The analysis is best-possible for any inner angle and it generalizes and unifies the known results that the set of supported solutions is a 2-approximation and that the efficient set itself is a 1-approximation. Moreover, it is shown that, for maximization problems, no approximation guarantee is achievable in general by considering larger ordering cones in the described fashion, which again generalizes a known result about the set of supported solutions.

Funder

Deutsche Forschungsgemeinschaft

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications,Business, Management and Accounting (miscellaneous)

Reference23 articles.

1. Ansari, Q.H., Yao, J.C. (eds.): Recent Developments in Vector Optimization, Vector Optimization, vol. 1. Springer, Berlin (2012)

2. Bazgan, C., Jamain, F., Vanderpooten, D.: Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43(1), 1–6 (2015)

3. Bazgan, C., Ruzika, S., Thielen, C., Vanderpooten, D.: The power of the weighted sum scalarization for approximating multiobjective optimization problems. Theory Comput. Syst. 66, 395–415 (2022)

4. Daskalakis, C., Diakonikolas, I., Yannakakis, M.: How good is the chord algorithm? SIAM J. Comput. 45(3), 811–858 (2016)

5. Diakonikolas, I., Yannakakis, M.: Succinct approximate convex Pareto curves. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 74–83. SIAM (2008)

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3