I wonder how systems like CPLEX, GUROBI, etc implement indicator constraints. Do they just implement Big M equivalents? If yes, what is then the justification for using them?
The question does not concern when to prefer using BigM constraints vs Indicator constraints. The question is if the developers of the solver coded the idea of an indicator constraint by coding its equivalent BigM constraint.