Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911805181263872 |
|---|---|
| author | Hoen, Alexander Oertel, Andy Gleixner, Ambros Nordström, Jakob |
| author_facet | Hoen, Alexander Oertel, Andy Gleixner, Ambros Nordström, Jakob |
| contents | It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations must preserve the fea sibility status and optimal value of the problem, but there is currently no established methodology to express and verify the equivalence of two mixed-integer programs. In this work, we take a first step in this direction by showing how the correctness of MIP presolve reductions on 0-1 integer linear programs can be certified by using (and suitably extending) the VeriPB tool for pseudo-Boolean proof logging. Our experimental evaluation on both decision and optimization instances demonstrates the computational viability of the approach and leads to suggestions for future revisions of the proof format that will help to reduce the verbosity of the certificates and to accelerate the certification and verification process further. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_09277 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs Hoen, Alexander Oertel, Andy Gleixner, Ambros Nordström, Jakob Optimization and Control It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations must preserve the fea sibility status and optimal value of the problem, but there is currently no established methodology to express and verify the equivalence of two mixed-integer programs. In this work, we take a first step in this direction by showing how the correctness of MIP presolve reductions on 0-1 integer linear programs can be certified by using (and suitably extending) the VeriPB tool for pseudo-Boolean proof logging. Our experimental evaluation on both decision and optimization instances demonstrates the computational viability of the approach and leads to suggestions for future revisions of the proof format that will help to reduce the verbosity of the certificates and to accelerate the certification and verification process further. |
| title | Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2401.09277 |