Then, computational sub-optimality guarantees can be obtained along with the approximate solutions, that might
outperform existing analytically derived sub-optimality guarantees, or
be the only class of sub-optimality guarantees in cases where no a priori known analytical guarantees are available for the given problem.