On the effects of combining objectives in multi-objective optimization

Unternehmensforschung - Tập 82 - Trang 1-18 - 2015
Stephan Dempe1, Gabriele Eichfelder2, Jörg Fliege3
1Department of Mathematics and Computer Science, Technische Universität Bergakademie Freiberg, Freiburg, Germany
2Institute for Mathematics, Technische Universität Ilmenau, Ilmenau, Germany
3CORMSIS, University of Southampton, Southampton, UK

Tóm tắt

In multi-objective optimization, one considers optimization problems with more than one objective function, and in general these objectives conflict each other. As the solution set of a multi-objective problem is often rather large and contains points of no interest to the decision-maker, strategies are sought that reduce the size of the solution set. One such strategy is to combine several objectives with each other, i.e. by summing them up, before employing tools to solve the resulting multi-objective optimization problem. This approach can be used to reduce the dimensionality of the objective space as well as to discard certain unwanted solutions, especially the ‘extreme’ ones found by minimizing just one of the objectives given in the classical sense while disregarding all others. In this paper, we discuss in detail how the strategy of combining objectives linearly influences the set of optimal, i.e. efficient solutions.

Tài liệu tham khảo

Borwein JM (1977) Proper efficient points for maximizations with respect to cones. SIAM J Control Optim 15:57–63 Cambini A, Luc DT, Martein L (2003) Order-preserving transforamtions and applications. J Optim Theory Appl 118:275–293 Ehrgott M (2005) Multicriteria optimization. Springer, Heidelberg Eichfelder G (2008) Adaptive scalarization methods in multiobjective optimization. Springer, Heidelberg Eichfelder G (2009) Scalarizations for adaptively solving multi-objective optimization problems. Comput Optim Appl 44:249–273 Engau A, Wiecek MM (2007) Cone characterizations of approximate solutions in real vector optimization. J Optim Theory Appl 134:499–513 Engau A, Wiecek MM (2009) Introducing nonpolyhedral cones to multiobjective programming. In: Barichard V et al (eds) Multiobjective programming and goal programming. Springer, Berlin, pp 35–45 Fliege J (2007) The effects of adding objectives to an optimisation problem on the solution set. Oper Res Lett 35:782–790 Gal T (1980) A note on size reduction of the objective functions matrix in vector maximum problems. In: Multiple criteria decision making theory and application, Lecture Notes in Economics and Mathematical Systems, Vol 177, pp 74–84 Gal T, Hanne T (1999) Consequences of dropping nonessential objectives for the application of MCDM methods. Eur J Oper Res 119(2):373–378 Gal T, Hanne T (2006) Nonessential objectives within network approaches for MCDM. Eur J Oper Res 168(2):584–592 Gal T, Leberling H (1977) Redundant objective functions in linear vector maximum problems and their determination. Eur J Oper Res 1(3):176–184 Göpfert A, Nehse R (1990) Vektoroptimierung. Theorie, Verfahren und Anwendungen. Teubner, Stuttgart Hunt BJ, Wiecek MM, Hughes SC (2010) Relative importance of criteria in multiobjective programming: a cone-based approach. Eur J Oper Res 207:936–945 Jahn J (2011) Vector optimization: theory, applications, and extensions, 2nd edn. Springer, Heidelberg Kaya CY, Maurer H (2014) A numerical method for finding the pareto front of nonconvex multiobjective optimal control problems. Comput Optim Appl 57:685–702 Miettinen KM (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, Boston Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York Noghin VD (1997) Relative importance of criteria: a quantitative approach. J Multi-Criteria Decis Anal 6:355–363 Noghin VD (2001) What is the relative importance of criteria and how to use it in MCDM. In: Köksalan M et al (eds) Multiple criteria decision making in the new millennium. Springer, Berlin, pp 59–68 Nožička F, Guddat J, Hollatz H, Bank B (1974) Theorie der linearen parametrischen Optimierung. Akademie-Verlag, Berlin Przybylski A, Gandibleux X, Ehrgott M (2010) A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J Comput 22(3):371–386 Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton Sawaragi Y, Nakayama H, Tanino T (1985) Theory of multiobjective optimization. Academic Press, London Tanaka M (1995) GA-based decision support system for multi-criteria optimization. Proc Int Conf Syst Man Cybern 2:1556–1561