Skip to main content
Springer Nature Link
Log in

An infeasible-interior-point potential-reduction algorithm for linear programming

  • Published:
Mathematical Programming Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA, e-mail: rehat@andrew.cmu.edu, , , , , , US

    Reha H. Tütüncü

Authors
  1. Reha H. Tütüncü
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 15, 1996 / Revised version received November 1997¶Published online February 25, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tütüncü, R. An infeasible-interior-point potential-reduction algorithm for linear programming. Math. Program. 86, 313–334 (1999). https://doi.org/10.1007/s101070050091

Download citation

  • Issue Date:

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