Generic well-posedness of minimization problems with mixed continuous constraints

In this paper we study mathematical programming problems with mixed constraints in a Banach space and show that most of the problems (in the Baire category sense) are well-posed. Our result is a generalization of a result of Ioffe et al. [SIAM J. Optim. 12 (2001) 461–478] obtained for finite-dimensional Banach spaces.