Skip to main content
SpringerLink
Log in

Linear Programming: Karmarkar Projective Algorithm

Karmarkar Algorithm

  • Reference work entry
Book cover Encyclopedia of Optimization

  • 280 Accesses

Article Outline

Keywords

See also

References

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

Access this chapter

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Anstreicher KM (1986) A monotonic projective algorithm for fractional linear programming. Algorithmica 1:483–498

    Article  MathSciNet  MATH  Google Scholar 

  2. Anstreicher KM (1996) Potential reduction algorithms. In: Terlaky T (ed) Interior point methods of mathematical programming. Kluwer, Dordrecht, pp 125–158

    Google Scholar 

  3. de Ghellinck G, Vial J-Ph (1986) A polynomial Newton method for linear programming. Algorithmica 1:425–453

    Article  MathSciNet  MATH  Google Scholar 

  4. Gay DM (1987) A variant of Karmarkar's linear programming algorithm for problems in standard form. Math Program 37:81–90

    Article  MathSciNet  MATH  Google Scholar 

  5. Gonzaga CC (1989) Conical projection algorithms for linear programming. Math Program 43:151–173

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Todd MJ (1997) Potential-reduction methods in mathematical programming. Math Program 76:3–45

    MathSciNet  Google Scholar 

  8. Ye Y (1991) An O(n3L) potential reduction algorithm for linear programming. Math Program 50:239–258

    Article  MATH  Google Scholar 

  9. Ye Y, Kojima M (1987) Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. Math Program 39:305–317

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Iowa, Iowa City, USA

    Kurt M. Anstreicher

Authors
  1. Kurt M. Anstreicher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Anstreicher, K.M. (2008). Linear Programming: Karmarkar Projective Algorithm . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_338

Download citation

Publish with us

Policies and ethics

Search

Navigation