Assuming, I have binary integer program, e.g. given by:
$ \arg\min_x \quad 0\\ \text{such that}\quad A_\text{eq} x = b_\text{eq}, x_i \in \{0,1\} $
Where also $[A_\text{eq}]_{ij} \in \{0,1\} $ and $b_\text{eq} \in \{0,1,2,\ldots\} $
- Is there any way to check whether this opt. problem is feasible?
- Is there a way to check whether there exist multiple solutions?