What we have done here is just branching the set into separate disjunctive sets. We can represent this process as a tree we call a search tree. We have to visit the tree until we reach the leaves to find a feasible solution. Among these leaves we will find the optimal solution.

---