In the present paper it is shown that an optimal solution of a convex programming problem may be regarded as the x component of the saddle point of the corresponding LAGRANGE function if and only if certain convex sets are seperable by a non vertical Surface.