A Duality Theorem for Convex Programs

A proof is given for a duality theorem for a class of convex programs, i.e., constrained minimization of convex functions. A simple example is included.