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篇论文的施引文献,订阅后可以查看论文全部施引文献