Abstract
Given a feasible solution, the inverse optimization problem is to modify some parameters of the original problem as little as possible, and sometimes also with bound restrictions on these adjustments, to make the feasible solution become an optimal solution under the new parameter values. So far it is unknown that for a problem which is solvable in polynomial time, whether its inverse problem is also solvable in polynomial time. In this note we answer this question by considering the inverse center location problem and show that even though the original problem is polynomially solvable, its inverse problem is NP–hard.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burton, D. and Toint, Ph.L., (1992). On an instance of the inverse shortest paths problem, Mathematical Programming, 53: 45–61.
Burton, D., Pulleyblank, B. and Toint, Ph.L. (1997). The inverse shortest path problem with upper bounds on shortest path costs, in Network Optimization, edited by P.M. Pardalos, D.H. Hearn and W.H. Hager, Lecture Notes in Economics and Mathematical Systems 450: 156–171.
Zhang, J.Z. and Liu, Z.H. (1996). Calculating some inverse linear programming problems, J. Computational and Applied Mathematics 72: 261–273.
Zhang, J.Z. and Ma, Z.F. (1996). A network flow method for solving some inverse combinatorial optimization problems, Optimization 37: 59–72.
Cai, M.C. and Li, Y.J. (1997). Inverse matroid intersection problem, ZOR Math. Meth. Oper. Res. 45: 235–243.
Yang, C. and Zhang, J. Z. (1999). Two general methods for inverse optimization problems, Appl. Math. Lett. 12(2): 69–72.
Christofides, N. (1975). Graph Theory: An Algorithmic Approach, Academic Press, London.
Papadimitriou, C.H. and Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey.
Cook, S.A. (1971). The complexity of theorem proving procedures, Proceedings of the 3rd ACM Symposium on the Theory of Computing, 151–158.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cai, M., Yang, X. & Zhang, J. The Complexity Analysis of the Inverse Center Location Problem. Journal of Global Optimization 15, 213–218 (1999). https://doi.org/10.1023/A:1008360312607
Issue Date:
DOI: https://doi.org/10.1023/A:1008360312607