Calculating and controlling the error of discrete representations of Pareto surfaces in convex multi-criteria optimization

Abstract 

A discrete set of points and their convex combinations can serve as a sparse representation of the Pareto surface in multiple objective convex optimization. We develop a method to evaluate the quality of such a representation, and show by example that in multiple objective radiotherapy planning, the number of Pareto optimal solutions needed to represent Pareto surfaces of up to five dimensions grows at most linearly with the number of objectives. The method described is also applicable to the representation of convex sets.

Keywords: IMRT, Multi objective, Pareto, Optimization, Discrete approximation