Effectively approximating Pareto frontiers by patch representations - with applications to supply chain optimization
Seiten
Most decisions in business require finding good compromises between conflicting criteria. This dissertation develops new methods which effectively approximate the set of such optimal trade-offs. Based on mathematical concepts such as patches and corner points, algorithms with provable guarantees on the solution quality are created. These algorithms are then applied to multicriteria models of risks and costs in supply chain optimization.
Trade-offs between conflicting objectives are required in most real-world optimization problems. Decision-makers require an approximation of the Pareto frontier which illustrates the corresponding optimal compromises. This thesis develops algorithms that can provide these approximations effectively with provable quality guarantees. In the first part, an algorithm for bicriteria mixed-integer problems is developed. Based on the concept of patches, it is shown that the algorithm obtains an almost-optimal convergence rate. The second part starts with a discussion of algorithms for computing an approximation quality measure for Pareto frontiers. On this basis, a new multicriteria optimization algorithm for an arbitrary number of objectives is developed. Finally, models for multicriteria robust optimization are studied with a focus on supply chains. In various case studies, the proposed algorithms are applied to supply chain models, in particular regarding the objectives of costs and risks. The results show the large practical applicability of the approaches in this thesis.
Trade-offs between conflicting objectives are required in most real-world optimization problems. Decision-makers require an approximation of the Pareto frontier which illustrates the corresponding optimal compromises. This thesis develops algorithms that can provide these approximations effectively with provable quality guarantees. In the first part, an algorithm for bicriteria mixed-integer problems is developed. Based on the concept of patches, it is shown that the algorithm obtains an almost-optimal convergence rate. The second part starts with a discussion of algorithms for computing an approximation quality measure for Pareto frontiers. On this basis, a new multicriteria optimization algorithm for an arbitrary number of objectives is developed. Finally, models for multicriteria robust optimization are studied with a focus on supply chains. In various case studies, the proposed algorithms are applied to supply chain models, in particular regarding the objectives of costs and risks. The results show the large practical applicability of the approaches in this thesis.
| Erscheinungsdatum | 23.06.2022 |
|---|---|
| Zusatzinfo | num., col. illus. and tab. |
| Verlagsort | Stuttgart |
| Sprache | englisch |
| Maße | 148 x 210 mm |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Schlagworte | B • Fraunhofer ITWM • Mathematical Modelling • Mathematiker • Operational Research • Operations Researcher • Optimization • purchasing and supply management • risk assessment • Supply-Chain Manager |
| ISBN-10 | 3-8396-1793-6 / 3839617936 |
| ISBN-13 | 978-3-8396-1793-9 / 9783839617939 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2025)
Springer Vieweg (Verlag)
CHF 62,95
Buch | Softcover (2025)
Springer Fachmedien Wiesbaden (Verlag)
CHF 69,95
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
