Karl-Heinz Küfer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Karl-Heinz Küfer has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Alena Klug
Fraunhofer ITWM
1 shared publication- Helene Krieg
Fraunhofer Institute for Industrial Mathematics ITWM, Kaiserslautern, Germany
1 shared publication Ingmar Schüle
Fraunhofer ITWM
1 shared publication- Jan Schwientek
Fraunhofer ITWM, Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany
1 shared publication - Kai Plociennik
Fraunhofer ITWM
1 shared publication Martin Bischoff
Siemens AG
1 shared publication
Latest Publications
- Open Access
- 29 March 2022
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 96 (1) , 39-82
Solving continuous set covering problems by means of semi-infinite optimization
This article introduces the new class of continuous set covering problems. These optimization problems result, among others, from product portfolio design tasks with products depending continuously on design parameters and the requirement that the product portfolio satisfies customer specifications that are provided as a compact set. We show that the problem can be formulated as semi-infinite optimization problem (SIP). Yet, the inherent non-smoothness of the semi-infinite constraint function hinders the straightforward application of standard methods from semi-infinite programming. We suggest an algorithm combining adaptive discretization of the infinite index set and replacement of the non-smooth constraint function by a two-parametric smoothing function. Under few requirements, the algorithm converges and the distance of a current iterate can be bounded in terms of the discretization and smoothing error. By means of a numerical example from product portfolio optimization, we demonstrate that the proposed algorithm only needs relatively few discretization points and thus keeps the problem dimensions small.
- 29 March 2022
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 96 (1) , 39-82
Open AccessSolving continuous set covering problems by means of semi-infinite optimization
This article introduces the new class of continuous set covering problems. These optimization problems result, among others, from product portfolio design tasks with products depending continuously on design parameters and the requirement that the product portfolio satisfies customer specifications that are provided as a compact set. We show that the problem can be formulated as semi-infinite optimization problem (SIP). Yet, the inherent non-smoothness of the semi-infinite constraint function hinders the straightforward application of standard methods from semi-infinite programming. We suggest an algorithm combining adaptive discretization of the infinite index set and replacement of the non-smooth constraint function by a two-parametric smoothing function. Under few requirements, the algorithm converges and the distance of a current iterate can be bounded in terms of the discretization and smoothing error. By means of a numerical example from product portfolio optimization, we demonstrate that the proposed algorithm only needs relatively few discretization points and thus keeps the problem dimensions small.
- 21 February 2016
- Published by Springer Nature
- p. 451-456
Optimized Pattern Design for Photovoltaic Power Stations
- 21 February 2016
- Published by Springer Nature
- p. 451-456
Optimized Pattern Design for Photovoltaic Power Stations