Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The iterative step in the linear programming algorithm of N. Karmarkar

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We simplify and strengthen the analysis of the improvement obtained in one step of Karmarkar's algorithm.

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

Similar content being viewed by others

References

  1. J. Borwein, G. Styan, and H. Wolkowicz, Some inequalities involving statistical expressions (solution of a problem of H. Foster),SIAM Rev.,24 (1982), 340–342.

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Padberg, A different convergence proof of the projective method for linear programming, Technical Report, New York University.

  4. C. Roos, On Karmarkar's projective method for linear programming, Report 85-23, Department of Mathematics and Informatics, Delft University.

  5. A. Schrivjer,Theory of Linear and Integer Programming, Wiley, New York (to appear).

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, University of Illinois, 1206 South Sixth Street, 61820, Campaign, IL, USA

    C. E. Blair

Authors
  1. C. E. Blair
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Nimrod Hegiddo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blair, C.E. The iterative step in the linear programming algorithm of N. Karmarkar. Algorithmica 1, 537–539 (1986). https://doi.org/10.1007/BF01840462

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation