Approximating multiobjective combinatorial optimization problems with the OWA criterion

The paper deals with a multiobjective combinatorial optimization problem with $K$ linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate the cost functions and compute a solution. It is well known that minimizing OWA for most basic combinatorial problems is weakly NP-hard even if the number of objectives $K$ equals two, and strongly NP-hard when $K$ is a part of the input. In this paper, the problem with nonincreasing weights in the OWA criterion and a large $K$ is considered. A method of reducing the number of objectives by appropriately aggregating the objective costs before solving the problem is proposed. It is shown that an optimal solution to the reduced problem has a guaranteed worst-case approximation ratio. Some new approximation results for the Hurwicz criterion, which is a special case of OWA, are also presented.

[1]  Olivier Spanjaard,et al.  Exact algorithms for OWA-optimization in multiobjective spanning tree problems , 2009, Comput. Oper. Res..

[2]  H. Raiffa,et al.  Games and Decisions: Introduction and Critical Survey. , 1958 .

[3]  Adam Kasperski,et al.  On the approximability of robust spanning tree problems , 2010, Theor. Comput. Sci..

[4]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decision-making , 1988 .

[5]  Adam Kasperski,et al.  Using the WOWA operator in robust discrete optimization problems , 2015, Int. J. Approx. Reason..

[6]  Marc Goerigk,et al.  Alternative formulations for the ordered weighted averaging objective , 2015, Inf. Process. Lett..

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Daniel Vanderpooten,et al.  Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[9]  E. L. Ulungu,et al.  Multi‐objective combinatorial optimization problems: A survey , 1994 .

[10]  Daniel Vanderpooten,et al.  General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems , 2010, Discret. Optim..

[11]  Justo Puerto,et al.  Ordered weighted average combinatorial optimization: Formulations and their properties , 2014, Discret. Appl. Math..

[12]  Xavier Gandibleux,et al.  An Annotated Bibliography of Multiobjective Combinatorial Optimization , 2000 .

[13]  Eli Upfal,et al.  Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems , 2007, ICALP.

[14]  Wlodzimierz Ogryczak,et al.  On solving linear programs with the ordered weighted averaging objective , 2003, Eur. J. Oper. Res..

[15]  Justo Puerto,et al.  Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem , 2017, Eur. J. Oper. Res..

[16]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[17]  Roger J.-B. Wets,et al.  The aggregation principle in scenario analysis stochastic optimization , 1989 .

[18]  Anil K. Jain.  Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[19]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[20]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[21]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decisionmaking , 1988, IEEE Trans. Syst. Man Cybern..

[22]  Benjamin Doerr.  Improved approximation algorithms for the Min-Max Selecting Items problem , 2013, Inf. Process. Lett..

[23]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[24]  R. Wets,et al.  Stochastic programming , 1989 .

[25]  Włodzimierz Ogryczak,et al.  On MILP Models for the OWA Optimization , 2012 .

[26]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[27]  Marc Goerigk,et al.  On scenario aggregation to approximate robust combinatorial optimization problems , 2018, Optim. Lett..

[28]  Adam Kasperski,et al.  Combinatorial optimization problems with uncertain costs and the OWA criterion , 2015, Theor. Comput. Sci..

[29]  Paweł Zieliński,et al.  Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey , 2016 .