Description: we explore the implications of
using decomposition-based methods over Pareto-based methods on algorithm convergence a probabilistic point of view. Namely, we investigate whether there is an advantage of using a decomposition-based method, for example using the Chebyshev scalarizing function, over Pareto-based methods.
To Search:
File list (Check if you may need any files):
multi-obj opt.pdf
Download