Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions

This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to parametric problems of semi-infinite and infinite programming, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. Part I is primarily devoted to the study of robust Lipschitzian stability of feasible solutions maps for such problems described by parameterized systems of infinitely many linear inequalities in Banach spaces of decision variables indexed by an arbitrary set T. The parameter space of admissible perturbations under consideration is formed by all bounded functions on T equipped with the standard supremum norm. Unless the index set T is finite, this space is intrinsically infinite-dimensional (nonreflexive and nonseparable) of the l∞ type. By using advanced tools of variational analysis and exploiting specific features of linear infinite systems, we establish complete characterizations of robust Lipschitzian stability entirely via their initial data with computing the exact bound of Lipschitzian moduli. A crucial part of our analysis addresses the precise computation of the coderivative of the feasible set mapping and its norm. The results obtained are new in both semi-infinite and infinite frameworks. (A correction to the this article has been appended at the end of the pdf file.)This research was partially supported by grants MTM2005-08572-C03 (01-02) from MEC (Spain) and FEDER (EU), MTM2008-06695-C03 (01-02) from MICINN (Spain), and ACOMP/2009/047&133 from Generalitat Valenciana (Spain); National Science Foundation (USA) under grant DMS-0603846