Papers
Topics
Authors
Recent
Search
2000 character limit reached

Inverse of the Gomory Corner Relaxation of Integer Programs

Published 30 Oct 2024 in math.OC | (2410.22653v1)

Abstract: We analyze the inverse of the Gomory corner relaxation (GCR) of a pure integer program (IP). 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 present a linear programming (LP) formulation for solving the inverse GCR under the $L_{1}$ and $L_{\infty}$ norms, with significantly fewer variables and constraints than existing LP formulations for solving the inverse IP in literature. We show that the inverse GCR bounds the inverse IP optimal value as tightly as the inverse LP relaxation under mild conditions. We provide sufficient conditions for the inverse GCR to exactly solve the inverse IP.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. A. Tarantola, Inverse Problem Theory and Methods for Model Parameter Estimation. SIAM: Society for Industrial and Applied Mathematics, 2005.
  2. Z. Erkin, M. D. Bailey, L. M. Maillart, A. J. Schaefer, and M. S. Roberts, “Eliciting patients’ revealed preferences: An inverse Markov decision process approach,” Decision Analysis, vol. 7, no. 4, pp. 358–365, 2010. https://doi.org/10.1287/deca.1100.0185.
  3. M. Bertero and M. Piana, Inverse Problems in Biomedical Imaging: Modeling and Methods of Solution. Springer, Milano, 2007.
  4. T. Ajayi, T. Lee, and A. J. Schaefer, “Objective selection for cancer treatment: An inverse optimization approach,” Operations Research, vol. 70, no. 3, pp. 1717–1738, 2022. https://doi.org/10.1287/opre.2021.2192.
  5. T. C. Y. Chan, T. Craig, T. Lee, and M. B. Sharpe, “Generalized inverse multiobjective optimization with application to cancer therapy,” Operations Research, vol. 62, no. 3, pp. 680–695, 2014. https://doi.org/10.1287/opre.2014.1267.
  6. J. C. Brigham, W. Aquino, F. G. Mitri, J. F. Greenleaf, and M. Fatemi, “Inverse estimation of viscoelastic material properties for solids immersed in fluids using vibroacoustic techniques,” Journal of Applied Physics, vol. 101, no. 2, 2007. https://doi.org/10.1063/1.2423227.
  7. D. Bertsimas, V. Gupta, and I. C. Paschalidis, “Data-driven estimation in equilibrium using inverse optimization,” Mathematical Programming, vol. 153, no. 2, pp. 595–633, 2015. https://doi.org/10.1007/s10107-014-0819-4.
  8. A. J. Schaefer, “Inverse integer programming,” Optimization Letters, vol. 3, no. 4, pp. 483–489, 2009. https://doi.org/10.1007/s11590-009-0131-z.
  9. J. B. Lamperski and A. J. Schaefer, “A polyhedral characterization of the inverse-feasible region of a mixed-integer program,” Operations Research Letters, vol. 43, no. 6, pp. 575–578, 2015. https://doi.org/10.1016/j.orl.2015.08.010.
  10. S. Huang, “Inverse problems of some NP-complete problems,” in Algorithmic Applications in Management: First International Conference, AAIM 2005, pp. 422–426, 2005. https://doi.org/10.1007/11496199_45.
  11. L. Wang, “Cutting plane algorithms for the inverse mixed integer linear programming problem,” Operations Research Letters, vol. 37, no. 2, pp. 114–116, 2009. https://doi.org/10.1016/j.orl.2008.12.001.
  12. Z. Duan and L. Wang, “Heuristic algorithms for the inverse mixed integer linear programming problem,” Journal of Global Optimization, vol. 51, no. 3, pp. 463–471, 2011. https://doi.org/10.1007/s10898-010-9637-2.
  13. M. Bodur, T. C. Y. Chan, and I. Y. Zhu, “Inverse mixed integer optimization: Polyhedral insights and trust region methods,” INFORMS Journal on Computing, vol. 34, no. 3, pp. 1471–1488, 2022. https://doi.org/10.1287/ijoc.2021.1138.
  14. J. Zhang and Z. Liu, “Calculating some inverse linear programming problems,” Journal of Computational and Applied Mathematics, vol. 72, no. 2, pp. 261–273, 1996. https://doi.org/10.1016/0377-0427(95)00277-4.
  15. J. Zhang and Z. Liu, “A further study on inverse linear programming problems,” Journal of Computational and Applied Mathematics, vol. 106, no. 2, pp. 345–359, 1999. https://doi.org/10.1016/S0377-0427(99)00080-1.
  16. R. K. Ahuja and J. B. Orlin, “Inverse optimization,” Operations Research, vol. 49, no. 5, pp. 771–783, 2001. https://doi.org/10.1287/opre.49.5.771.10607.
  17. O. Tavaslıoğlu, T. Lee, S. Valeva, and A. J. Schaefer, “On the structure of the inverse-feasible region of a linear program,” Operations Research Letters, vol. 46, no. 1, pp. 147–152, 2018. https://doi.org/10.1016/j.orl.2017.12.004.
  18. T. C. Y. Chan, T. Lee, and D. Terekhov, “Inverse optimization: Closed-form solutions, geometry, and goodness of fit,” Management Science, vol. 65, no. 3, pp. 1115–1135, 2019. https://doi.org/10.1287/mnsc.2017.2992.
  19. G. Ralph E., “Some polyhedra related to combinatorial problems,” Linear Algebra and its Applications, vol. 2, no. 4, pp. 451–558, 1969. https://doi.org/10.1016/0024-3795(69)90017-2.
  20. R. E. Gomory, “The atoms of integer programming,” Annals of Operations Research, vol. 149, no. 1, pp. 99–102, 2007. https://doi.org/10.1007/s10479-006-0110-z.
  21. S. Hoşten and R. R. Thomas, “Gomory integer programs,” Mathematical Programming, vol. 96, no. 2, pp. 271–292, 2003. https://doi.org/10.1007/s10107-003-0386-6.
  22. J.-P. Richard and S. S. Dey, 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. Springer, 2010. https://doi.org/10.1007/978-3-540-68279-0.
  23. M. Fischetti and M. Monaci, “How tight is the corner relaxation?,” Discrete Optimization, vol. 5, no. 2, pp. 262–269, 2008. https://doi.org/10.1016/j.disopt.2006.11.010.
  24. M. Köppe, Q. Louveaux, R. Weismantel, and L. A. Wolsey, “Extended formulations for Gomory corner polyhedra,” Discrete Optimization, vol. 1, no. 2, pp. 141–165, 2004. https://doi.org/10.1016/j.disopt.2004.06.001.
  25. A. N. Letchford, “Binary clutter inequalities for integer programs,” Mathematical Programming, vol. 98, no. 1, pp. 201–221, 2003. https://doi.org/10.1007/s10107-003-0402-x.
  26. D.-S. Chen and S. Zionts, “Comparison of some algorithms for solving the group theoretic integer programming problem,” Operations Research, vol. 24, no. 6, pp. 1120–1128, 1976. https://doi.org/10.1287/opre.24.6.1120.
  27. J. F. Shapiro, “Dynamic programming algorithms for the integer programming problem—I: The integer programming problem viewed as a knapsack type problem,” Operations Research, vol. 16, no. 1, pp. 103–121, 1968. https://doi.org/10.1287/opre.16.1.103.
  28. J. Zhang, Z. Ma, and C. Yang, “A column generation method for inverse shortest path problems,” Zeitschrift für Operations Research, vol. 41, no. 3, pp. 347–358, 1995. https://doi.org/10.1007/BF01432364.
  29. D. Burton and P. L. Toint, “On an instance of the inverse shortest paths problem,” Mathematical Programming, vol. 53, no. 1, pp. 45–61, 1992.
  30. S. Xu and J. Zhang, “An inverse problem of the weighted shortest path problem,” Japan Journal of Industrial and Applied Mathematics, vol. 12, no. 1, pp. 47–59, 1995.
  31. H. J. S. Smith, “On systems of linear indeterminate equations and congruences,” Philosophical Transactions of the Royal Society of London, vol. 151, pp. 293–326, 1861. https://doi.org/10.1098/rstl.1861.0016.
  32. S. Birmpilis, G. Labahn, and A. Storjohann, “A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix,” Journal of Symbolic Computation, vol. 116, pp. 146–182, 2023. https://doi.org/10.48550/arXiv.2111.09949.
  33. J.-G. Dumas, B. D. Saunders, and G. Villard, “On efficient sparse integer matrix Smith normal form computations,” Journal of Symbolic Computation, vol. 32, no. 1, pp. 71–99, 2001. https://doi.org/10.1006/jsco.2001.0451.
  34. G. Jäger and C. Wagner, “Efficient parallelizations of Hermite and Smith normal form algorithms,” Parallel Computing, vol. 35, no. 6, pp. 345–357, 2009. https://doi.org/10.1016/j.parco.2009.01.003.
  35. R. Kannan and A. Bachem, “Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix,” SIAM Journal on Computing, vol. 8, no. 4, pp. 499–507, 1979. https://doi.org/10.1137/0208040.
  36. D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization. Athena Scientific and Dynamic Ideas, LLC, 1997.
  37. Prentice-Hall, 1993.
  38. A. Gleixner, G. Hendel, G. Gamrath, T. Achterberg, M. Bastubbe, T. Berthold, P. Christophel, K. Jarck, T. Koch, J. Linderoth, M. Lübbecke, H. D. Mittelmann, D. Ozyurt, T. K. Ralphs, D. Salvagnin, and Y. Shinano, “MIPLIB 2017: Data-driven compilation of the 6th mixed integer programming library,” Mathematical Programming Computation, vol. 13, no. 3, pp. 443–490, 2021. https://doi.org/10.1007/s12532-020-00194-3.
  39. Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” 2023. Accessed: 10-01-2024.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.

Sign Up for Free