On Implicit Active Constraints in Linear Semi-Infinite Programs with Unbounded Coefficients
The concept of implicit active constraints at a given point provides useful local information about the solution set of linear semi-infinite systems and about the optimal set in linear semi-infinite programming provided the set of gradient vectors of the constraints is bounded, commonly under the additional assumption that there exists some strong Slater point. This paper shows that the mentioned global boundedness condition can be replaced by a weaker local condition (LUB) based on locally active constraints (active in a ball of small radius whose center is some nominal point), providing geometric information about the solution set and Karush-Kuhn-Tucker type conditions for the optimal solution to be strongly unique. The maintaining of the latter property under sufficiently small perturbations of all the data is also analyzed, giving a characterization of its stability with respect to these perturbations in terms of the strong Slater condition, the so-called Extended-Nürnberger condition, and the LUB condition.
KeywordsLinear semi-infinite programming Implicit active constraints Extended active constraints Locally upper bounded systems Strongly unique solution Stability
Unable to display preview. Download preview PDF.
- 14.Nürnberger, G.: Unicity in semi-infinite optimization. In: Brosowski, B., Deutsch, F. (eds.) Parametric Optimization and Approximation, pp. 231–247. Birkhäuser, Basel (1985) Google Scholar