Approximation of Pareto surfaces in multicriteria optimization
In many practical optimization problems, several objectives need to be considered. A common task is to approximate the nondominated set which allows a decision maker to study the trade-offs between conflicting objectives.In this thesis, the simplicial sandwiching algorithm, a well-known algorithm for the approximation of convex bounded nondominated sets, is analyzed, extended, and improved.
