Skip to main content
SpringerLink
Log in

A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

A cutting plane method for linear programming is described. This method is an extension of Atkinson and Vaidya's algorithm, and uses the central trajectory. The logarithmic barrier function is used explicitly, motivated partly by the successful implementation of such algorithms. This makes it possible to maintain primal and dual iterates, thus allowing termination at will, instead of having to solve to completion. This algorithm has the same complexity (O(nL 2) iterations) as Atkinson and Vaidya's algorithm, but improves upon it in that it is a “long-step” version, while theirs is a “short-step” one in some sense. For this reason, this algorithm is computationally much more promising as well. This algorithm can be of use in solving combinatorial optimization problems with large numbers of constraints, such as the Traveling Salesman Problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.S. Atkinson and P.M. Vaidya, A cutting plane algorithm for convex programming that uses analytic centers, Mathematical Programming 69 (1995) 1–43.

    Google Scholar 

  2. O. Bahn, O. Du Merle, J.L. Goffin and J.P. Vial, A cutting plane method from analytic centers for stochastic programming, Mathematical Programming 69 (1995) 45–73.

    Google Scholar 

  3. J. Elzinga and T.J. Moore, A central cutting plane algorithm for the convex programming problem, Mathematical Programming 8 (1975) 134–145.

    Google Scholar 

  4. J.-L. Goffin, J. Gondzio, R. Sarkissian and J.-P. Vial, Solving nonlinear multicommodity network flow problems by the analytic center cutting plane method, Mathematical Programming 76 (1997) 131–154.

    Article  Google Scholar 

  5. J.-L. Goffin, Z.-Q. Luo and Y. Ye, Complexity analysis of an interior cutting plane method for convex feasibility problems, SIAM Journal on Optimization 6 (1996) 638–652.

    Google Scholar 

  6. J.-L. Goffin and J.-P. Vial, Multiple cuts in the analytic center cutting plane method, SIAM Journal on Optimization 11 (2001) 199–222.

    Google Scholar 

  7. J. Gondzio, Warm start of the primal-dual method applied in the cutting plane scheme, Mathematical Programming 83 (1998) 125–143.

    Google Scholar 

  8. J. Gondzio, O. du Merle, R. Sarkissian and J.-P. Vial, ACCPM-A library for convex optimization based on an analytic center cutting plane method, European Journal of Operational Research 94 (1996) 206–211.

    Google Scholar 

  9. M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).

  10. D. den Hertog, Interior point approach to linear, quadratic and convex programming, algorithms and complexity, Ph.D. thesis, Faculty of Mathematics and Informatics, TU Delft, The Netherlands (September 1992). Subsequently published by Kluwer Academic, Dordrecht (1994).

    Google Scholar 

  11. D. den Hertog, J. Kaliski, C. Roos and T. Terlaky, A logarithmic barrier cutting plane method for convex programming problems, Annals of Operations Research 58 (1995) 69–98.

    Google Scholar 

  12. D. den Hertog, C. Roos and T. Terlaky, A build-up variant of the path-following method for LP, Operations Research Letters 12 (1992) 181–186.

    Google Scholar 

  13. D. den Hertog, C. Roos and T. Terlaky, Adding and deleting constraints in the logarithmic barrier method for LP, in:Advances in Optimization and Approximation, eds. D.-Z. Du and J. Sun (Kluwer Academic, Dordrecht, The Netherlands, 1994) pp. 166–185.

    Google Scholar 

  14. J. Kaliski, D. Haglin, C. Roos and T. Terlaky, Logarithmic barrier decomposition methods for semiinfinite programming, International Transactions in Operations Research 4 (1997) 285–303.

    Google Scholar 

  15. Z.-Q. Luo, Analysis of a cutting plane method that uses weighted analytic center and multiple cuts, SIAM Journal on Optimization 7 (1997) 697–716.

    Google Scholar 

  16. Z.-Q. Luo, C. Roos and T. Terlaky, Complexity analysis of a logarithmic barrier decomposition method for semi-infinite linear programming, Applied Numerical Mathematics 29(3) (1999) 379–395.

    Google Scholar 

  17. N. Megiddo, On finding primal-and dual-optimal bases, ORSA Journal on Computing 3 (1991) 63–65.

    Google Scholar 

  18. J.E. Mitchell, An interior point cutting plane algorithm for Ising spin glass problems, in: Operations Research Proceedings, SOR 1997, Jena, Germany, eds. P. Kischka and H.-W. Lorenz (Springer, 1998) pp. 114–119.

  19. J.E.Mitchell, Computational experience with an interior point cutting plane algorithm, SIAM Journal on Optimization 10(4) (2000) 1212–1227.

    Google Scholar 

  20. J.E. Mitchell and B. Borchers, Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm, in: High Performance Optimization, eds. H.L. Frenk et al. (Kluwer Academic, Dordrecht, 2000) pp. 349–366.

    Google Scholar 

  21. Y.E. Nesterov and A.S. Nemirovsky, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms (SIAM, Philadelphia, PA, 1993).

    Google Scholar 

  22. S. Ramaswamy and J.E. Mitchell, On updating the analytic center after the addition of multiple cuts, Technical Report 37–94–423, DSES, Rensselaer Polytechnic Institute, Troy, NY (October 1994). Substantially revised: August, 1998.

  23. S. Ramaswamy and J.E.Mitchell, A long step cutting plane algorithm that uses the volumetric barrier, Technical report, DSES, Rensselaer Polytechnic Institute, Troy, NY (June 1995).

  24. J. Renegar, A polynomial-time algorithm based on Newton's method for linear programming, Mathematical Programming 40 (1988) 59–93.

    Google Scholar 

  25. C. Roos, T. Terlaky and J.-Ph. Vial, Theory and Algorithms for Linear Optimization: An Interior Point Approach (Wiley, Chichester, 1997).

    Google Scholar 

  26. C. Roos and J.P. Vial, Long steps with the logarithmic penalty barrier function in linear programming, in: Economic Decision-Making: Games, Economics and Optimization, dedicated to J.H. Dreze, eds. J. Gabszevwicz, J.F. Richard and L. Wolsey (Elsevier, Amsterdam, 1989) pp. 433–441.

    Google Scholar 

  27. G. Sonnevend, An "analytic center" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in: Proceedings of the 12th IFIP Conference on Systems Modeling and Optimization, Budapest, 1985, eds. A. Prekopa, J. Szelezsan and B. Strazicky, Lecture Notes in Control and Information Sciences, Vol. 84 (Springer, Berlin, 1986) pp. 866–876.

    Google Scholar 

  28. S.P. Tarasov, L.G. Khachiyan and I.I. Erlikh, The method of inscribed ellipsoids, Soviet Mathematics Doklady 37 (1988) 226–230.

    Google Scholar 

  29. P.M. Vaidya, A locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope, in: Progress in Mathematical Programming, ed. N. Megiddo (Springer, New York, 1989) pp. 79–90.

    Google Scholar 

  30. P.M. Vaidya, A new algorithm for minimizing convex functions over convex sets, Mathematical Programming 73 (1996) 291–341.

    Google Scholar 

  31. Y. Ye, A potential reduction algorithm allowing column generation, SIAM Journal on Optimization 2 (1992) 7–20.

    Google Scholar 

  32. Y. Ye, Complexity analysis of the analytic center cutting plane method that uses multiple cuts, Mathematical Programming 78 (1997) 85–104.

    Google Scholar 

  33. Y. Ye, O. Güler, R.A. Tapia and Y. Zhang, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Mathematical Programming 59 (1993) 151–162.

    Google Scholar 

  34. Y. Zhang, R.A. Tapia and J.E. Dennis, On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms, SIAM Journal on Optimization 2(2) (1992) 304–324.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, 12180, USA

    John E. Mitchell

  2. Information Services Division, Research and Development, United Airlines, 1200 E. Algonquin Road, Elk Grove Village, IL, 60007, USA

    Srinivasan Ramaswamy

Authors
  1. John E. Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Srinivasan Ramaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitchell, J.E., Ramaswamy, S. A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming. Annals of Operations Research 99, 95–122 (2000). https://doi.org/10.1023/A:1019288816566

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019288816566

Search

Navigation