On Stable Feasible Sets in Generalized Semi-infinite Programming

We consider the feasible set of a generalized semi-infinite programming problem with a one-dimensional index set of inequality constraints depending on the state variable. The latter dependence on the state variable gives rise to a complicated structure of the feasible set. Under appropriate transversality conditions we partially present the local description of feasible sets in new coordinates by means of the finitely many basic functions