A relaxation in ILP involves solving a modified version of the problem where integer constraints are removed, allowing continuous variables. Solving the relaxed problem gives a bound on the optimal solution and guides the search process in methods like branch-and-bound.