Now we want to argue that the solution we get is actually feasible and this is true because every variable is either 0 or 1. Moreover we can prove that this is a 2-approximation algorithm in the following way. The cost of the solution we get is less or equal than 2 times the cost of the optimal solution of the relaxed problem. But the relaxed problem is clearly smaller then the optimal solution.

---