## Inverse of the Gomory Corner Relaxation of Integer Programs

\(\) We analyze the inverse of integer programs (IPs) using the Gomory corner relaxation (GCR). We prove the inverse GCR is equivalent to the inverse of a shortest path problem, yielding a polyhedral representation of the GCR inverse-feasible region. We propose a linear program formulation for the inverse GCR under \(L_1\) and \(L_\infty\) norms.The inverse … Read more