In this paper, convex continuous-time programming problem with inequality
type of constraints is considered. We derive new saddle point optimality
conditions and classical duality results such as weak and strong duality
properties, under additional regularity assumption. A fundamental tool,
employed in the derivation of the necessary saddle point optimality criteria
and strong duality result for convex continuous-time programming, is a new
version of a theorem of the alternative in infinite-dimensional spaces.