
The inverse Gomory corner relaxation (GCR) provides a tighter bound on the inverse integer programming (IP) optimal value than the inverse LP relaxation under mild conditions, and can be formulated as the inverse of a shortest path problem, leading to a more computationally tractable approach.


coremsg

inverse-optimization-of-the-gomory-corner-relaxation-of-integer-programs-and-its-relationship-to-inverse-linear-programming-relaxation


Inverse Optimization of the Gomory Corner Relaxation of Integer Programs and Its Relationship to Inverse Linear Programming Relaxation


title_rewrite


This paper proposes a novel inverse optimization method to learn the implicit convex constraints of an optimization problem from a set of expert-accepted and rejected solutions, aiming to improve the efficiency and accuracy of future decision-making processes.


expert-guided-inverse-optimization-for-inferring-convex-constraints-in-optimization-models


Expert-Guided Inverse Optimization for Inferring Convex Constraints in Optimization Models
