Salvato in:
Dettagli Bibliografici
Autori principali: Lyu, George, Nosrat, Fatemeh, Schaefer, Andrew J.
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:https://arxiv.org/abs/2410.22653
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916850593431552
author Lyu, George
Nosrat, Fatemeh
Schaefer, Andrew J.
author_facet Lyu, George
Nosrat, Fatemeh
Schaefer, Andrew J.
contents We explore the inverse of integer programs (IPs) by studying the inverse of their Gomory corner relaxations (GCRs). We show that solving a set of inverse GCR problems always yields an upper bound on the optimal value of the inverse IP that is at least as tight as the optimal value of the inverse of the linear program (LP) relaxation. We provide conditions under which solving a set of inverse GCR problems exactly solves the inverse IP. We propose an LP formulation for solving the inverse GCR under the $L_1$ and $L_\infty$ norms by reformulating the inverse GCR as the inverse of a shortest path problem.
format Preprint
id arxiv_https___arxiv_org_abs_2410_22653
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Inverse of the Gomory Corner Relaxation of Integer Programs
Lyu, George
Nosrat, Fatemeh
Schaefer, Andrew J.
Optimization and Control
We explore the inverse of integer programs (IPs) by studying the inverse of their Gomory corner relaxations (GCRs). We show that solving a set of inverse GCR problems always yields an upper bound on the optimal value of the inverse IP that is at least as tight as the optimal value of the inverse of the linear program (LP) relaxation. We provide conditions under which solving a set of inverse GCR problems exactly solves the inverse IP. We propose an LP formulation for solving the inverse GCR under the $L_1$ and $L_\infty$ norms by reformulating the inverse GCR as the inverse of a shortest path problem.
title Inverse of the Gomory Corner Relaxation of Integer Programs
topic Optimization and Control
url https://arxiv.org/abs/2410.22653