The theory of non-negative increasing and co-radiant (ICR) functions defined on ordered topological vector spaces has been well developed. In this article, we present the theory of extended real-valued ICR functions defined on an ordered topological vector space X. We first give a characterization for non-positive ICR functions and examine abstract convexity of this class of functions. We also investigate polar function and subdifferential of these functions. Finally, we characterize abstract convexity, support set and subdifferential of extended real-valued ICR functions.
In this paper, we study the optimization problem (P) of minimizing a convex function over a constraint set with nonconvex constraint functions. We do this by given new characterizations of Robinson’s constraint qualification, which reduces to the combination of generalized Slater’s condition and generalized sharpened nondegeneracy condition for nonconvex programming problems with nearly convex feasible sets at a reference point. Next, using a version of the strong CHIP, we present a constraint qualification which is necessary for optimality of the problem (P). Finally, using new characterizations of Robinson’s constraint qualification, we give necessary and sufficient conditions for optimality of the problem (P).