Abstract
We show how to speed up Karmarkar's linear programming algorithm for the case of multicommodity flows. The special structure of the constraint matrix is exploited to obtain an algorithm for the multicommodity flow problem which requires O(s 3.5 v 2.5 eL) arithmetic operations, each operation being performed to a precision of O (L) bits. Herev is the number of vertices ande is the number of edges in the given network,s is the number of commodities, andL is bounded by the number of bits in the input. We obtain a speed up of the order of (e 0.5/v 0.5)+(e 2.5/v 2.5s2) over Karmarkar's modified algorithm which is substantial for dense networks. The techniques in the paper can also be used to speed up any interior point algorithm for any linear programming problem whose constraint matrix is structurally similar to the one in the multicommodity flow problem.
Similar content being viewed by others
References
J. Birge and L. Qi, “Computing block-angular Karmarkar projections with applications to stochastic programming,” Technical Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, 1986)
V. Chvatal,Linear Programming (Freeman, New York, 1983).
G.H. Golub and C.F. Van Loan,Matrix Computations (The Johns Hopkins University Press, Baltimore, MA, 1983).
T.C. Hu,Integer Programming and Network Flows (Addison-Wesley, Reading, MA, 1969).
S. Kapoor and P.M. Vaidya, “Fast algorithms for convex quadratic programming and multicommodity flows,”Proceedings 18th Annual ACM Symposium Theory of Computing (1986), pp. 147–159.
N. Karmarkar, “A new polynomial-time algorithm for linear programming”,Combinatorica 4(4) (1984) 373–395.
L.G. Khachian, “Polynomial algorithms in linear programming”,USSR Computational Mathematics and Mathematical Physics 20 (1979) 191–194.
M.K. Kozlov, S.P. Tarasov and L.G. Khachian, “Polynomial solvability of convex quadratic programming”,Doklady Akademii Nauk SSSR 5 (1979) 1051–1053.
C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
G.W. Stewar,Introduction to Matrix Computations (Academic Press, New York, 1973).
P.M. Vaidya, “An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations,” in:Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 29–38. |Extended version in:Mathematical Programming 47 (1990) 175–201.
J.H. Wilkinson,The Algebraic Eigenvalue Problem (Oxford University Press, Oxford, 1965).
G. Zoutendijk,Mathematical Programming Methods (North-Holland, New York, 1976).
Author information
Authors and Affiliations
Additional information
Research supported by a fellowship from the Shell Foundation.
Research supported by NSF under grant NSF DCR-8404239.
Rights and permissions
About this article
Cite this article
Kapoor, S., Vaidya, P.M. Speeding up Karmarkar's algorithm for multicommodity flows. Mathematical Programming 73, 111–127 (1996). https://doi.org/10.1007/BF02592100
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592100