Is it possible to transform the following problem:
$$\min\big\{ (X-\sum v_i b_i)^2 \big\} $$ where $X \geq 0$, $v_i \geq 0$ and $b_i \in \{0,1\}$
to an integer linear programming problem like this:
In my case $v_i$ is the coefficient and $b_i$ the variable.