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.
No takes yet. Share an insight, caveat, or question.
Gowda et al. (1990) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: