Fr. 87.00

Approximation of Pareto surfaces in multicriteria optimization

English · Paperback / Softback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more

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. In the first part, an analysis of the convergence behavior of the sandwiching algorithm is presented. Then, a method for the efficient computation of the approximation quality of approximations created by the sandwiching algorithm is derived which improves the sandwiching approximation time by up to 94%. In the last part, the ideas of the sandwiching algorithm are extended to the efficient approximation of multiple convex nondominated sets, which can arise from multiobjective mixed-integer convex optimization problems. An algorithm is introduced that exploits convexity and is applicable to general numbers of objective functions. Its performance is illustrated using several numerical examples.

Product details

Authors Ina Lammel
Assisted by Fraunhofer ITWM (Editor), Fraunhofer ITWM (Editor)
Publisher Fraunhofer Verlag
 
Languages English
Product format Paperback / Softback
Released 01.06.2024
 
EAN 9783839619964
ISBN 978-3-8396-1996-4
No. of pages 161
Dimensions 143 mm x 7 mm x 206 mm
Weight 246 g
Illustrations num., mostly col. illus. and tab.
Subject Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.