Comparison of Some Scalarization Methods in Multiobjective Optimization

The paper presents an analysis, characterizations and comparison of six commonly used scalarization methods in multiobjective optimization. The properties of these methods are investigated with respect to the basic characteristics such as ordering cone, convexity and boundedness, the ability of generating proper efficient solutions, the ability to consider reference points which is a choice of decision maker as a solution and weighting preferences of decision maker, the number of additional constraints and decision variables. The paper also presents new characteristics for these methods and relations between them. The main characteristics of these scalarization methods are illustrated on the same example.

[1]  M. I. Henig.  Proper efficiency with respect to cones , 1982 .

[2]  Nergiz Kasimbeyli,et al.  Existence and characterization theorems in nonconvex vector optimization , 2015, J. Glob. Optim..

[3]  Rafail N. Gasimov,et al.  Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization , 2003 .

[4]  Refail Kasimbeyli,et al.  Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods , 2015, MCO.

[5]  C. Yalçin Kaya,et al.  A New Scalarization Technique to Approximate Pareto Fronts of Problems with Disconnected Feasible Sets , 2013, Journal of Optimization Theory and Applications.

[6]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[7]  R. N. Gasimov.  Characterization of the Benson proper efficiency and scalarization in nonconvex vector optimization , 2001 .

[8]  Refail Kasimbeyli.  Radial epiderivatives and set-valued optimization , 2009 .

[9]  Panos M. Pardalos,et al.  Handbook of Multicriteria Analysis , 2010 .

[10]  Alexander M. Rubinov,et al.  Scalarization and Nonlinear Scalar Duality for Vector Optimization with Preferences that are not necessarily a Pre-order Relation , 2004, J. Glob. Optim..

[11]  Tugba Saraç,et al.  A multi-objective programming approach to 1.5-dimensional assortment problem , 2007, Eur. J. Oper. Res..

[12]  Majid Soleimani-Damaneh,et al.  On Benson’s scalarization in multiobjective optimization , 2016, Optim. Lett..

[13]  Matthias Ehrgott,et al.  Constructing robust crew schedules with bicriteria optimization , 2002 .

[14]  Refail Kasimbeyli,et al.  Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization , 2009, INFOR Inf. Syst. Oper. Res..

[15]  Gabriele Eichfelder,et al.  Adaptive Scalarization Methods in Multiobjective Optimization , 2008, Vector Optimization.

[16]  P. Serafini,et al.  Scalarizing vector optimization problems , 1984 .

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

[18]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[19]  H. P. Benson,et al.  Existence of efficient solutions for vector maximization problems , 1978 .

[20]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[21]  Kathrin Klamroth,et al.  Constrained optimization using multiple objective programming , 2007, J. Glob. Optim..

[22]  Panos M. Pardalos,et al.  A survey of recent developments in multiobjective optimization , 2007, Ann. Oper. Res..

[23]  Andrzej P. Wierzbicki,et al.  Reference Point Methods in Vector Optimization and Decision Support , 1998 .

[24]  Refail Kasimbeyli,et al.  A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization , 2009, SIAM J. Optim..

[25]  Kaisa Miettinen,et al.  On scalarizing functions in multiobjective optimization , 2002, OR Spectr..

[26]  Rafail N. Gasimov,et al.  A multiobjective faculty-course-time slot assignment problem with preferences , 2007, Math. Comput. Model..

[27]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[28]  F. Flores-Bazán,et al.  A unified vector optimization problem: complete scalarizations and applications , 2011 .

[29]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..

[30]  C. Gerth,et al.  Nonconvex separation theorems and some applications in vector optimization , 1990 .

[31]  H. P. Benson,et al.  An improved definition of proper efficiency for vector maximization with respect to cones , 1979 .

[32]  Refail Kasimbeyli.  A conic scalarization method in multi-objective optimization , 2013, J. Glob. Optim..

[33]  T. L. Saaty,et al.  The computational algorithm for the parametric objective function , 1955 .

[34]  Ignacy Kaliszewski,et al.  A modified weighted tchebycheff metric for multiple objective programming , 1987, Comput. Oper. Res..

[35]  V. Bowman.  On the Relationship of the Tchebycheff Norm and the Efficient Frontier of Multiple-Criteria Objectives , 1976 .