A comparison of constraint quali cations in in nite-dimensional convex programming

In this paper the relationships between various constraint qualifications for infinite-dimensional convex programs are investigated. Using Robinson’s refinement of the duality result of Rockafellar, it is demonstrated that the constraint qualification proposed by Rockafellar provides a systematic mechanism for comparing many constraint qualifications as well as establishing new results in different topological environments.