The Mathematical Intelligencer

, Volume 9, Issue 2, pp 4–10 | Cite as

Karmarkar’s algorithm and its place in applied mathematics

  • Gilbert Strang


Steep Descent Simplex Method Steep Ascent Fractional Linear Program Logarithmic Barrier Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Karmarkar, A new polynomial-time algorithm for linear programming.Combinatorial 4 (1984), 373–395.CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    L. G. Khachian, A polynomial algorithm in linear programming,Soviet Math. Doklady 20 (1979), 191–194.Google Scholar
  3. 3.
    G. Strang,Introduction to Applied Mathematics, Wellesley-Cambridge Press (Box 157, Wellesley, MA 02181) (1986).zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 1987

Authors and Affiliations

  • Gilbert Strang
    • 1
  1. 1.Department of MathematicsMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations