We consider the problem of estimating optima of integer programs { max <Emphasis Type="Bold">cx | A <Emphasis Type="Bold">x≤<Emphasis Type="Bold">b,<Emphasis Type="Bold">0≤<Emphasis Type="Bold">x≤<Emphasis Type="Bold">1, <Emphasis Type="Bold">x− integral} where <Emphasis Type="Bold">b<Emphasis Type="Bold">0, <Emphasis Type="Bold">c≥<Emphasis Type="Bold">0 are rational vectors and A is an arbitrary rational m×n matrix. Using randomized rounding we find an efficiently verifiable sufficient condition for optima of such...</emphasis></emphasis></emphasis></emphasis></emphasis></emphasis></emphasis></emphasis></emphasis></emphasis></emphasis>

We consider the problem of estimating optima of integer programs { max cx | A x≤ b, 0≤ x≤ 1, x− integral} where b 0, c≥ 0 are rational vectors and A is an arbitrary rational m×n matrix. Using randomized rounding we find an efficiently verifiable sufficient condition for optima of...