ABSTRACT
We have discussed the various aspects of studying optimality conditions for the convex programming problem (CP ). Throughout, we concentrated on establishing the standard or the sequential optimality conditions at the exact point of minima. But it may not be always possible to find the point of minimizer. There may be cases where the infimum exists but is not attainable. For instance, consider
min ex subject to x ∈ R.
