Skip to main content
SpringerLink
Log in

Karmarkar’s algorithm and its place in applied mathematics

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope 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

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

Instant access to the full article PDF.

Institutional subscriptions

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. L. G. Khachian, A polynomial algorithm in linear programming,Soviet Math. Doklady 20 (1979), 191–194.

    Google Scholar 

  3. G. Strang,Introduction to Applied Mathematics, Wellesley-Cambridge Press (Box 157, Wellesley, MA 02181) (1986).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Gilbert Strang

Authors
  1. Gilbert Strang
    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

Strang, G. Karmarkar’s algorithm and its place in applied mathematics. The Mathematical Intelligencer 9, 4–10 (1987). https://doi.org/10.1007/BF03025891

Download citation

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation