A New Global Scalarization Method for Multiobjective Optimization with an Arbitrary Ordering Cone

Download Download as PDF (Size:318KB)  HTML   XML  PP. 154-163  
DOI: 10.4236/am.2017.82013    149 Downloads   212 Views  


We propose a new scalarization method which consists in constructing, for a given multiobjective optimization problem, a single scalarization function, whose global minimum points are exactly vector critical points of the original problem. This equivalence holds globally and enables one to use global optimization algorithms (for example, classical genetic algorithms with “roulette wheel” selection) to produce multiple solutions of the multiobjective problem. In this article we prove the mentioned equivalence and show that, if the ordering cone is polyhedral and the function being optimized is piecewise differentiable, then computing the values of a scalarization function reduces to solving a quadratic programming problem. We also present some preliminary numerical results pertaining to this new method.

Cite this paper

Rahmo, E. and Studniarski, M. (2017) A New Global Scalarization Method for Multiobjective Optimization with an Arbitrary Ordering Cone. Applied Mathematics, 8, 154-163. doi: 10.4236/am.2017.82013.


[1] Ehrgott, M. and Gandibleux, X. (Eds.) (2002) Multiple Criteria Optimization: State of the Art Annotated Bibliography Surveys. Kluwer, Boston.
[2] Wierzbicki, A.P. (1986) On the Completeness and Constructiveness of Parametric Characterizations to Vector Optimization Problems. Operations-Research-Spektrum, 8, 73-87.
[3] Bakhtin, V.I. and Gorokhovik, V.V. (2010) First and Second Order Optimality Conditions for Vector Optimization Problems on Metric Spaces. Proceedings of the Steklov Institute of Mathematics, 269, S28-S39.
[4] Ginchev, I., Guerraggio, A. and Rocca, M. (2005) Isolated Minimizers and Proper Efficiency for C0,1 Constrained Vector Optimization Problems. Journal of Mathematical Analysis and Applications, 309, 353-368.
[5] Pascoletti, A. and Serafini, P. (1984) Scalarizing Vector Optimization Problems. Journal of Optimization Theory and Applications, 42, 499-524.
[6] Eichfelder, G. (2008) Adaptive Scalarization Methods in Multiobjective Optimization. Springer, Berlin.
[7] Eichfelder, G. (2014) Variable Ordering Structures in Vector Optimization. Springer, Berlin.
[8] Gutiérrez, C., Jiménez, B., Novo, V. and Ruiz-Garzon, G. (2016) Vector Critical Points and Efficiency in Vector Optimization with Lipschitz Functions. Optimization Letters, 10, 47-62.
[9] Nakayama, H., Yun, Y. and Yoon, M. (2009) Sequential Approximate Multiobjective Optimization Using Computational Intelligence. Springer, Berlin.
[10] Clarke, F.H. (1983) Optimization and Nonsmooth Analysis. John Wiley & Sons, New York.
[11] Scholtes, S. (2012) Introduction to Piecewise Differentiable Equations. Springer, New York.
[12] Guerraggio, A. and Luc, T. (2001) Optimality Conditions for C1,1 Vector Optimization Problems. Journal of Optimization Theory and Applications, 109, 615-629.
[13] Gopfert, A., Riahi, H., Tammer, Ch. and Zalinescu, C. (2003) Variational Methods in Partially Ordered Spaces. Springer, New York.
[14] Rockafellar, R.T. (1970) Convex Analysis. Princeton University Press, Princeton.
[15] Lange, K. (2013) Optimization. 2nd Edition, Springer, New York.
[16] Boyd, S. and Vandenberghe, L. (2004) Convex Optimization. Cambridge University Press, Cambridge.
[17] Arioli, M., Laratta, A. and Menchi, O. (1984) Numerical Computation of the Projection of a Point onto a Polyhedron. Journal of Optimization Theory and Applications, 43, 495-525.
[18] Mückeley, M. (1992) Computing the Vector in the Convex Hull of a Finite Set of Points Having Minimal Length. Optimization, 26, 15-26.
[19] Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T. (2002) A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6, 182-197.

comments powered by Disqus

Copyright © 2017 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.