'Test that MIP problems are deterministic.'

def test_mip_consistency(self):

    data_recs = []
    result_recs = []
    for i in range(5):
        obj = Minimize(square((self.y_int - 0.2)))
        p = Problem(obj, [(self.A_bool == 0), (self.x_bool == self.B_int)])
        data_recs.append(p.get_problem_data(ECOS_BB))
    for i in range(1, 5):
        for key in ['c', 'A', 'b', 'G', 'h', 'bool_vars_idx', 'int_vars_idx']:
            lh_item = data_recs[0][key]
            rh_item = data_recs[i][key]
            if (key in ['A', 'G']):
                lh_item = lh_item.todense()
                rh_item = rh_item.todense()
            self.assertItemsAlmostEqual(lh_item, rh_item)
