Skip to main content
SpringerLink
Log in
Book cover

Optimization pp 147–158Cite as

An 0(n3L) approximate center method for linear programming

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1405))

Abstract

We present a modification of a previously published path following algorithm for the solution of the linear programming and show that it requires only 0(n3L) arithmetic operations.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A. and Wright, M.H., On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's method, Mathematical Programming 36 (1986), 183–209.

    Article  MathSciNet  MATH  Google Scholar 

  2. Gonzaga, C.C., An algorithm for solving linear programming problems in 0(n3L) operations, Memorandum No UCB/ERL M87/10, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, 1987.

    Google Scholar 

  3. Karmarkar, N., A new polynomial-time algorithm for linear programming, Combinatorica, Vol. 4 (1984) 373–395.

    Article  MathSciNet  MATH  Google Scholar 

  4. Megiddo, N., Pathways to the optimal set in linear programming, Proceedings of the Mathematical Programming Symposium of Japan, Nagoya, Japan, (1986), 1–36.

    Google Scholar 

  5. Monteiro, R.C. and Adler, L., An 0(n3L) primal-dual interior point algorithm for linear programming, Report ORC 87-4, Operation Research Center, Department of Operations Research, University of California, Berkeley, 1987.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Roos, C., A new trajectory following polynomial-time algorithm for the linear programming problem, Journal of Optimization Theory and its Applications, forthcoming, 1988.

    Google Scholar 

  8. Roos, C. and Vial, J.-Ph., A polynomial method of approximate centers for linear programming, submitted to Mathematical Programming, 1988.

    Google Scholar 

  9. Sonnevend, Gy., An analytic centre for polyhedrons and new classes of global algorithms for linear (Smooth, Convex) programming, Preprint, Department of Numerical Analysis, Institute of Mathematics, Eotvos University, Budapest, Hungary, 1985.

    Google Scholar 

  10. Vaidya, P.M., An algorithm for linear programming which requires 0(((m + n)n2 + (m + n)1.5n)L) Arithmetic Operations, Preprint, AT & T Bell Laboratories, Murray Hill, New Jersey, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakulteit Winskund en Informatika, Universiteit, Giuliannalaan, 26-28, BL Delft, Holland

    C. Roos

Authors
  1. C. Roos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Szymon Dolecki

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer Verlag

About this paper

Cite this paper

Roos, C. (1989). An 0(n3L) approximate center method for linear programming. In: Dolecki, S. (eds) Optimization. Lecture Notes in Mathematics, vol 1405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083592

Download citation

  • DOI: https://doi.org/10.1007/BFb0083592

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51970-6

  • Online ISBN: 978-3-540-46867-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation