This article studies three classes of optimization problems with bilevel structure including
mathematical programs with equilibrium constraints (MPECs) and semi-infinite problems
(SIPs). The main goal of this article is to provide results which establish the existence of feasible
points of the problems. These results are based on the so-called KKM lemma. We are also
interested in the convexity properties of these problems.
