In this paper. we consider a special class of optimization problems which contains infinitely many inequality constraints and finitely many complementarity constraints known as the semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC). We propose Lagrange type dual model for the SIMPEC and obtain their duality results using convexity assumptions. Further. https://www.pomyslnaszycie.com/life-is-better-with-my-boys-womens-graphic-tee-ice-blue-online-now/