This paper presents characterizations of optimality for the abstract convex program
![](//static-cambridge-org.ezproxyberklee.flo.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS1446788700017882/resource/name/S1446788700017882_eqnU1.gif?pub-status=live)
when S is an arbitrary convex cone in a finite dimensional space, Ω is a convex set and p and g are respectively convex and S-convex (on Ω). These characterizations, which include a Lagrange multiplier theorem and do not presume any a priori constraint qualification, subsume those presently in the literature.