A semi-infinite approach to design centering
Abstract. We consider design centering problems in their reformulation as general semi-infinite optimization problems. The main goal of the article is to show that the Reduction Ansatz of semi-infinite programming generically holds at each solution of the reformulated design centering problem. This is of fundamental importance for theory and numerical methods which base on the intrinsic bilevel structure of the problem.
For the genericity considerations we prove a new first order necessary optimality condition in design centering. Since in the course of our analysis also a certain standard semi-infinite programming problem turns out to be related to design centering, the connections to this problem are studied, too.