Error bounds are developed for a class of quadratic programming problems. The absolute error between an approximate feasible solution, generated via a dual formulation, and the true optimal solution is measured. Furthermore, these error bounds involve considerably less work computationally than existing estimates.