Abstract
We consider the integer programming version of inverse optimization. Using superadditive duality, we provide a polyhedral description of the set of inverse-feasible objectives. We then describe two algorithmic approaches for solving the inverse integer programming problem.
Similar content being viewed by others
References
Ahuja R.K., Orlin J.B.: Inverse optimization. Oper. Res. 49(5), 771–783 (2001)
Cai M.C., Yang X.G., Zhang J.Z.: The complexity analysis of the inverse center location problem. J. Global Optim. 15(2), 213–218 (1999)
Francis R.L., McGinnis L.F. Jr, White J.A.: Facility Layout and Location: an Analytical Approach. Prentice Hall, Englewood Cliffs (1992)
Hartmann, M.E.: Cutting planes and the complexity of the integer hull. Ph.D thesis, Cornell University (1988)
Heuberger C.: Inverse combinatorial optimization: a survey on problems, methods and results. J. Comb. Optim. 8(3), 329–361 (2004)
Huang, S.: Inverse problems of some \({\mathcal{NP}}\) -complete problems. In: Lecture Notes in Computer Science, vol. 3251, pp. 422–426. Springer, Heidelberg (2005)
Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Zhang J., Liu Z.: Calculating some inverse linear programming problems. J. Comput. Appl. Math. 72(2), 261–273 (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Schaefer, A.J. Inverse integer programming. Optim Lett 3, 483–489 (2009). https://doi.org/10.1007/s11590-009-0131-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-009-0131-z