Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 65–90Cite as

Linear Programming Algorithms

  • Chapter

  • 1030 Accesses

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

Abstract

There are basically three types of algorithms for Linear Programming: the Simplex Algorithm (see Section 3.2), interior point algorithms, and the Ellipsoid Method.

This is a preview of subscription content, 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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

General Literature

  • Grötschel, M., Lovász, L., and Schrijver, A. [1988]: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin 1988

    Book  MATH  Google Scholar 

  • Padberg, M. [1995]: Linear Optimization and Extensions. Springer, Berlin 1995

    MATH  Google Scholar 

  • Schrijver, A. [1986]: Theory of Linear and Integer Programming. Wiley, Chichester 1986

    MATH  Google Scholar 

Cited References

  • Bland, R.G., Goldfarb, D., and Todd, M.J. [1981]: The ellipsoid method: a survey. Operations Research 29 (1981), 1039–1091

    Article  MathSciNet  MATH  Google Scholar 

  • Edmonds, J. [1967]: Systems of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards B 71 (1967), 241–245

    MathSciNet  Google Scholar 

  • Frank, A., and Tardos, É. [1987]: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7 (1987), 49–65

    Article  MathSciNet  MATH  Google Scholar 

  • Gács, P., and Lovász, L. [1981]: Khachiyan’s algorithm for linear programming. Mathematical Programming Study 14 (1981), 61–68

    Article  MATH  Google Scholar 

  • Grötschel, M., Lovász, L., and Schrijver, A. [1981]: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981), 169–197

    Article  MathSciNet  MATH  Google Scholar 

  • Iudin, D.B., and Nemirovskii, A.S. [1976]: Informational complexity and effective methods of solution for convex extremal problems. Ekonomika i Matematicheskie Metody 12 (1976), 357–369 [in Russian]

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Karp, R.M., and Papadimitriou, C.H. [1982]: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11 (1982), 620–632

    Article  MathSciNet  MATH  Google Scholar 

  • Khachiyan, L.G. [1979]: A polynomial algorithm in linear programming [in Russian]. Doklady Akademii Nauk SSSR 244 (1979) 1093–1096. English translation: Soviet Mathematics Doklady 20 (1979), 191-194

    MathSciNet  MATH  Google Scholar 

  • Khintchine, A. [1956]: Kettenbrüche. Teubner, Leipzig 1956

    MATH  Google Scholar 

  • Padberg, M.W., and Rao, M.R. [1981]: The Russian method for linear programming III: Bounded integer programming. Research Report 81–39, New York University 1981

    Google Scholar 

  • Shor, N.Z. [1977]: Cut-off method with space extension in convex programming problems. Cybernetics 13 (1977), 94–96

    Google Scholar 

  • Steinitz, E. [1922]: Polyeder und Raumeinteilungen. Enzykl. Math. Wiss. 3 (1922), 1–139

    Google Scholar 

  • Tardos, É. [1986]: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34 (1986), 250–256

    Article  MathSciNet  MATH  Google Scholar 

  • Vaidya, P.M. [1996]: A new algorithm for minimizing convex functions over convex sets. Mathematical Programming 73 (1996), 291–341

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstraße 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2002). Linear Programming Algorithms. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21711-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21711-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-21713-9

  • Online ISBN: 978-3-662-21711-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation