We introduce computable a-priori and a-posteriori error bounds for optimality and feasibility of a point generated as the rounding of an optimal point of the LP relaxation of a mixed integer linear optimization problem. Treating the mesh size of integer vectors as a parameter allows us to study the effect of different `granularities’ in the discrete variables on the error bounds. Our analysis mainly bases on the construction of a so-called grid relaxation retract. Relations to proximity results and the integer rounding property are highlighted.
Citation
Mathematical Programming, Vol. 156 (2016), 101-123, DOI 10.1007/s10107-015-0872-7.