A semi-infinite optimization problem involving a quasi-convex objective function and infinitely many convex constraint functions with data uncertainty is considered. A surrogate duality theorem for the semi-infinite optimization problem is given under a closed and convex cone constraint qualification.