How to solve an optimization problem with non-convex constraint

Nonconvex
1

I want to solve the following problem
x is a vector of binary variables and b is a static vector of constants

minimize sum(1/(x.*b))
subject to
sum((x.*b).^2)/(sum(x.*b))^2 >= epsilon

2

FAQ: Why doesn’t CVX accept my problem? [READ THIS FIRST]