DeepAI AI Chat
Log In Sign Up

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems

by   Cristina Bazgan, et al.
Technische Universität Kaiserslautern
Université Paris-Dauphine

We determine the power of the weighted sum scalarization with respect to the computation of approximations for general multiobjective minimization and maximization problems. Additionally, we introduce a new multi-factor notion of approximation that is specifically tailored to the multiobjective case and its inherent trade-offs between different objectives. For minimization problems, we provide an efficient algorithm that computes an approximation of a multiobjective problem by using an exact or approximate algorithm for its weighted sum scalarization. In case that an exact algorithm for the weighted sum scalarization is used, this algorithm comes arbitrarily close to the best approximation quality that is obtainable by supported solutions - both with respect to the common notion of approximation and with respect to the new multi-factor notion. Moreover, the algorithm yields the currently best approximation results for several well-known multiobjective minimization problems. For maximization problems, however, we show that a polynomial approximation guarantee can, in general, not be obtained in more than one of the objective functions simultaneously by supported solutions.


page 1

page 2

page 3

page 4


Approximating Biobjective Minimization Problems Using General Ordering Cones

This article investigates the approximation quality achievable for biobj...

Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory

We study the approximation of general multiobjective optimization proble...

Approximating Multiobjective Optimization Problems: How exact can you be?

It is well known that, under very weak assumptions, multiobjective optim...

One-Exact Approximate Pareto Sets

Papadimitriou and Yannakakis show that the polynomial-time solvability o...

An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems

In a widely studied class of multi-parametric optimization problems, the...

A Structural Investigation of the Approximability of Polynomial-Time Problems

We initiate the systematic study of a recently introduced polynomial-tim...

Approximation Strategies for Incomplete MaxSAT

Incomplete MaxSAT solving aims to quickly find a solution that attempts ...