A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
Authors:
- 9 August 2011
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 60 (8-9) , 1091-1104
Abstract
A numerical technique is presented for constructing an approximation of the weak Pareto front of nonconvex multi-objective optimization problems, based on a new Tchebychev-type scalarization and its equivalent representations. First, existing results on the standard Tchebychev scalarization, the weak Pareto and Pareto minima, as well as the uniqueness of the optimal value in the Pareto front, are recalled and discussed for the case when the set of weak Pareto minima is the same as the set of Pareto minima, namely, when weak Pareto minima are also Pareto minima. Of the two algorithms we present, Algorithm 1 is based on this discussion. Algorithm 2, on the other hand, is based on the new scalarization incorporating rays associated with the weights of the scalarization in the value (or objective) space, as constraints. We prove two relevant results for the new scalarization. The new scalarization and the resulting Algorithm 2 are particularly effective in constructing an approximation of the weak Pareto sections of the front. We illustrate the working and capability of both algorithms by means of smooth and nonsmooth test problems with connected and disconnected Pareto fronts.Keywords
This publication has 24 references indexed in Scilit:
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimizationJournal of Computational and Applied Mathematics, 2009
- Box-constrained multi-objective optimization: A gradient-like method without “a priori” scalarizationEuropean Journal of Operational Research, 2008
- Multiobjective Optimization Through a Series of Single-Objective FormulationsSIAM Journal on Optimization, 2008
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methodsComputational Optimization and Applications, 2007
- Finding preferred subsets of Pareto optimal solutionsComputational Optimization and Applications, 2007
- Generating ε-efficient solutions in multiobjective programmingEuropean Journal of Operational Research, 2007
- An update rule and a convergence result for a penalty function methodJournal of Industrial and Management Optimization, 2007
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective ProblemsSIAM Journal on Optimization, 2005
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Comments on properties of the minmax solutions in goal programmingEuropean Journal of Operational Research, 2001