Abstract
This paper proposes an optimization model and shows that most inverse combinatorial optimization problems so far discussed can be fit into this model as special cases. We propose a Newton-type algorithm for this model under l ∞ norm. This algorithm can solve the model in strongly polynomial time if the subproblem involved is solvable in strongly polynomial time for any fixed value of the parameter appearing in the subproblem, and it is shown that most particular inverse optimization problems encountered are this kind. Therefore, through this paper we show that a large group of inverse optimization problems can be handled in a uniform way and solved in strongly polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Burton and PhL. Toint, “On an instance of the inverse shortest paths problem,” Mathematical Programming, vol. 53, pp. 45–61, 1992.
S. Xu and J. Zhang, “An inverse problem of the weighted shortest path problem,” Japan Journal of Industrial and Applied Mathematics, vol. 12, pp. 47–59, 1995.
J. Zhang, Z. Ma, and C. Yang, “A column generation method for inverse shortest path problem,” ZOR Mathematical Methods of Operations Research, vol. 41, pp. 347–358, 1995.
J. Zhang and Z. Liu, “Calculating some inverse linear programming problem,” Journal of Computational and Applied Mathematics, vol. 72, pp. 261–273, 1996.
J. Zhang, Z. Liu, and Z. Ma, “On inverse problem of minimum spanning tree with partition constraints,” ZOR-Mathematical Methods of Operations Research, vol. 44, pp. 347–358, 1996.
J. Zhang and Z. Ma, “A network flow method for solving some inverse combinatorial optimization problems,” Optimization, vol. 37, pp. 59–72, 1996.
C. Yang and J. Zhang, “Inverse maximum flow and minimum cut problems,” Optimization, vol. 40, pp. 147–170, 1997.
J. Zhang, S. Xu, and Z. Ma, “An algorithm for inverse minimum spanning tree problem,” Optimization Methods and Software, vol. 8, pp. 69–84, 1997.
C. Yang and J. Zhang, “Inverse maximum capacity problem,” Operations Research Spektrum, vol. 20, pp. 97–100, 1998.
Z. Hu and Z. Liu, “A strongly polynomial algorithm for the inverse arborescence problem,” Discrete Applied Mathematics, vol. 82, pp. 135–154, 1998.
C. Yang and J. Zhang, “Two general methods for inverse optimization problems,” Applied Mathematics Letters, vol. 12, pp. 69–72, 1999.
J. Zhang, Z. Liu, and Z. Ma, “Inverse fractional matching problem,” The Journal of Australia Mathematics Society, Ser. B: Applied Mathematics, vol. 40, pp. 484–496, 1999.
J. Zhang and Z. Liu, “Inverse maximum perfect matching” (research report), 2001. (See http://www.cityu.edu.hk/ ma/staff/zhang/matching.pdf).
Z. Zhang and Z. Liu, “Afurther study on inverse linear programming,” J. Computational and Applied Mathematics, vol. 106, pp. 345–359, 1999.
J. Zhang, Z. Liu, and Z. Ma, “Some reverse location problem,” European J. Operations Research, vol. 124, pp. 77–88, 2000.
C. Yang and J. Zhang, “A constrained capacity expansion problem on network,” International Journal of Computer Mathematics, vol. 70, pp. 19–33, 1998.
Z. Zhang, C. Yang, and Y. Lin, “A class of bottleneck expansion problem,” Computers and Operations Research, vol. 28, pp. 505–519, 2001.
N. Megiddo, “Combinatorial optimization with rational objective functions,” Mathematics of Operations Research, vol. 4, pp. 414–424, 1979.
N. Megiddo, “Applying parallel computation algorithms in the design of serial algorithms,” J. ACM, vol. 30, pp. 852–865, 1983.
T. Radzik, “Parametric flow, weighted means of cuts, and fractional combinatorial optimization,” Complexity in Numerical Optimization, World Scientific Publishing Co: Singapore, 1993, pp. 351–386.
R.K. Ahuja, T.I. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: Englewood Cliffs, New Jersey, 1993.
A. Frank, “A weighted matroid intersection algorithm,” J. Algorithms, vol. 2, pp. 328–336, 1981.
J. Edmonds, “Matroid intersection,” in Annals of Discrete Mathematics, vol. 4, P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.), North-Holland: Amsterdam, 1979, pp. 39–49.
I. Averbakh, O. Berman, and A.P. Punnen, “Constrained matroidal bottleneck problem,” Discrete Applied Mathematics, vol. 63, pp. 201–214, 1995.
J. Zhang and Z. Liu, “An oracle-strongly polynomial algorithm for bottleneck expansion problems” Optimization Methods and Software, vol. 17, 2002.
R.M. Karp, “A characterization of the minimum mean cycle in digraph,” Discrete Mathematics, vol. 23, pp. 309–311, 1978.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, J., Liu, Z. A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm. Journal of Combinatorial Optimization 6, 207–227 (2002). https://doi.org/10.1023/A:1013807829021
Issue Date:
DOI: https://doi.org/10.1023/A:1013807829021