  We develop a new method called affine FR for recovering Slater's condition
for semidefinite programming (SDP) relaxations of combinatorial optimization
(CO) problems. Affine FR is a user-friendly method, as it is fully automatic
and only requires a description of the problem. We provide a rigorous analysis
of differences between affine FR and the existing methods. We also present
numerical results to demonstrate the effectiveness of affine FR in reducing the
size of SDP relaxations for CO problems.
