γ-Active Constraints in Convex Semi-Infinite Programming

In this article, we extend the definition of γ-active constraints for linear semi-infinite programming to a definition applicable to convex semi-infinite programming, by two approaches. The first approach entails the use of the subdifferentials of the convex constraints at a point, while the second approach is based on the linearization of the convex inequality system by means of the convex conjugates of the defining functions. By both these methods, we manage to extend the results on γ-active constraints from the linear case to the convex case.