Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330)

Constraint qualifications and duality results are obtained for a convex program in infinite dimensions, when the constraint decomposes into two parts. Under the restriction that one part consists of finitely many affine constraints, then Slater's constraint qualification can be replaced by the weaker quasi-relative interior constraint qualification. The restriction is then weakened to a local compactness assumption, or to assuming that the sum of two closed convex cones is closed.