Abstract
We describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
I. Adler, M.G.C. Resende, G. Veiga and N.K. Karmarkar, “An implementation of Karmarkar's algorithm for linear programming,”Mathematical Programming 44 (1989) 297–335.
K.M. Anstreicher, “A monotonic projection algorithm for fractional linear programming,”Algorithmica 1 (1986) 483–498.
D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming I. Affine and projective scaling trajectories,”Transactions of the American Mathematical Society 314 (1989) 499–526.
D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming II. Legendre transform coordinates and central trajectories,”Transactions of the American Mathematical Society 314 (1989) 527–581.
B. Borchers and J.E. Mitchell, “Using an interior point method in a branch and bound algorithm for integer programming,” Technical Report 195, Mathematical Sciences, Rensselaer Polytechnic Institute (Troy, NY, 1991).
In Chan Choi, C.L. Monma and D.F. Shanno, “Further development of a primal-dual interior point method,”ORSA Journal on Computing 2 (1990) 304–311.
N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem,” Technical report, GSIA, Carnegie-Mellon University (Pittsburgh, 1976).
G.B. Dantzig, “Maximization of a linear function of variables subject to linear inequalities,” in: Tj.C. Koopmans, ed.,Activity Analysis of Production and Allocation (Wiley, New York, 1951) pp. 339–347.
U. Derigs and A. Metz, “On the use of optimal fractional matchings for solving the (integer) matching problem,”Computing 36 (1986) 263–270.
J. Edmonds, “Maximum matching and a polyhedron with 0, 1 vertices,”Journal of Research National Bureau of Standards 69B (1965) 125–130.
J. Edmonds, “Paths, trees and flowers,”Canadian Journal of Mathematics 17 (1965) 449–467.
R.M. Freund, “A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”,”Mathematical Programming (Series B) 52 (1991) 441–466.
D.M. Gay, “A variant of Karmarkar's linear programming algorithm for problems in standard form,”Mathematical Programming 37 (1987) 81–90.
J.A. George and M.T. Heath, “Solution of sparse linear least squares problems using Givens rotations,”Linear Algebra and its Applications 34 (1980) 69–83.
J.A. George and E.G.Y. Ng, “Orthogonal reduction of sparse matrices to upper triangular form using Householder transformations,”SIAM Journal on Scientific and Statistical Computing 7 (1986) 460–472.
J.-L. Goffin, “Affine and projective transformations in non-differentiable optimization,” in: K.-H. Hoffmann, J.-B. Hiriart-Urruty, C. Lemarechal and J. Zowe, eds.,Trends in Mathematical Optimization, International Series of Numerical Mathematics No. 84 (Birkhauser, Basel-Boston, 1988) pp. 79–91.
J.-L. Goffin, A. Haurie and J.-P. Vial, “Decomposition and nondifferentiable optimization with the projective algorithm,” Technical Report 91-01-17, Faculty of Management, McGill University (Montreal, Que., 1990).
J.-L. Goffin and J.-P. Vial, “Cutting planes and column generation techniques with the projective algorithm,”Journal of Optimization Theory and Applications 65 (1990) 409–429.
D. Goldfarb and M.J. Todd, “Linear programming,” in G.L. Nemhauser et al., eds.,Optimization (North-Holland, Amsterdam, 1989) Chapter 2, pp. 73–170.
G.H. Golub and C.F. Van Loan,Matrix Computations (Johns Hopkins University Press, Baltimore, MD, 1983).
R.E. Gomory and T.C. Hu, “Multi terminal network flows,”Journal of the Society for Industrial and Applied Mathematics 9 (1961) 551–571.
C.C. Gonzaga, “A conical projection algorithm for linear programming,”Mathematical Programming 43 (1989) 151–174.
M. Grötschel, Private Communication, 1987.
M. Grötschel and O. Holland, “Solving matching problems with linear programming,”Mathematical Programming 33 (1985) 243–259.
M. Grötschel, L. Lovasz and A. Schrijver, “The ellipsoid method and its conseqeunces in combinatorial optimization,”Combinatorica 1 (1981) 169–197.
D. den Hertog and C. Roos, “A survey of search directions in interior point methods for linear programming,”Mathematical Programming (Series B) 52 (1991) 481–509.
IBM.IBM Optimization Subroutine Library Guide and Reference, Publication number SC23-0519-1 (1990).
N.K. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.
N.K. Karmarkar, “An interior-point approach to NP-complete problems (Part I),” in: J.C. Lagarias and M.J. Todd, eds.,Mathematical Developments Arising from Linear Programming, Contemporary Mathematics No. 114 (American Mathematical Society, Providence, RI, 1991) pp. 297–308.
N.K. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, “An interior point algorithm to solve computationally difficult set covering problems,”Mathematical Programming (Series B) 52 (1991) 597–618.
S. Lin, “Computer solutions to the traveling salesman problem,”Bell System Technical Journal 44 (1965) 2245–2269.
L. Lovász and M.D. Plummer,Matching Theory (Akadémiai Kiadó, Budapest, 1986).
I.J. Lustig, R.E. Marsten and D.F. Shanno, “Computational experience with a primal-dual interior point method for linear programming,”Linear Algebra and its Applications 152 (1991) 191–222.
I.J. Lustig, R.E. Marsten and D.F. Shanno, “On implementating Mehrotra's predictor-corrector interior point method for linear programming,” to appear in:SIAM Journal on Optimization.
N. Megiddo, “Pathways to the optimal set in linear programming,” in: N. Megiddo, ed.,Progress in Mathematical Programming (Springer, New York, 1989) pp. 131–158.
N. Megiddo and M. Shub, “Boundary behaviour of interior point algorithms in linear programming,”Mathematics of Operations Research 14 (1989) 97–146.
J.E. Mitchell,Karmarkar's Algorithm and Combinatorial Optimization Problems, Ph.D. thesis, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1988).
J.E. Mitchell, “An interior point column generation method for linear programming using shifted barriers,” Technical Report 191, Mathematical Sciences, Rensselaer Polytechnic Institute (Troy, NY, 1990).
J.E. Mitchell and M.J. Todd, “A variant of Karmarkar's linear programming algorithm for problems with some unrestricted variables,”SIAM Journal on Matrix Analysis and Applications 10 (1989) 30–38.
J.E. Mitchell and M.J. Todd, “Solving matching problems using Karmarkar's algorithm,” in: J.C. Lagarias and M.J. Todd, eds.,Mathematical Developments Arising from Linear Programming, Contemporary Mathematics No. 114 (American Mathematical Society, Providence, RI, 1991) pp. 309–318.
M.W. Padberg and M.R. Rao, “Odd minimum cut-sets andb-matchings,”Mathematics of Operations Research 7 (1982) 67–80.
C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
SAS Institute, Inc, Cary, North Carolina,SAS User's Guide, Version 5 (1985).
A.E. Steger, “An extension of Karmarkar's algorithm for bounded linear programming problems,” Master's thesis, State University of New York at Stony Brook (Stony Brook, NY, 1985).
M.J. Todd and B.P. Burrell, “An extension of Karmarkar's algorithm for linear programming using dual variables,”Algorithmica 1 (1986) 409–424.
R.J. Vanderbei, M.S. Meketon and B.A. Freedman, “A modification of Karmarkar's linear programming algorithm,”Algorithmica 1 (1986) 395–407.
Y. Ye, “A potential reduction algorithm allowing column generation,”SIAM Journal on Optimization 2 (1992) 7–20.
Y. Ye and M. Kojima, “Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,”Mathematical Programming 39 (1987) 305–317.
Author information
Authors and Affiliations
Additional information
Computational facilities provided by the Cornell Computational Optimization Project supported by NSF Grant DMS-8706133 and by the Cornell National Supercomputer Facility. The Cornell National Supercomputer Facility is a resource of the Center for Theory and Simulation in Science and Engineering at Cornell Unversity, which is funded in part by the National Science Foundation, New York State, and the IBM Corporation. The research of both authors was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.
Research partially supported by ONR Grant N00014-90-J-1714.
Research partially supported by NSF Grant ECS-8602534 and by ONR Contract N00014-87-K-0212.
Rights and permissions
About this article
Cite this article
Mitchell, J.E., Todd, M.J. Solving combinatorial optimization problems using Karmarkar's algorithm. Mathematical Programming 56, 245–284 (1992). https://doi.org/10.1007/BF01580902
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580902