Skip to main content
SpringerLink
Log in

Algorithmes de programmation linéaire

  • Chapter
Optimisation combinatoire

Part of the book series: Collection IRIS ((IRIS))

  • 664 Accesses

Résumé

Il y a essentiellement trois types d’algorithmes en programmation linéaire: l’algorithme du simplexe (voir paragraphe 3.2), les algorithmes de points intérieurs et la méthode des ellipsoïdes.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

Litterature générale

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

    MATH  Google Scholar 

  • Padberg, M. [1999]: Linear Optimization and Extensions. Second edition. Springer, Berlin 1999

    MATH  Google Scholar 

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

    MATH  Google Scholar 

Références citées

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

    Article  MATH  MathSciNet  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

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Iudin, D.B., 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  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  • Padberg, M.W., 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. Enzyklopädie der MathematischenWissenschaften, Band 3 (1922), 1–139

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MathSciNet  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

  2. Faculté de mathématiques, Université Paris-VI, 175, rue du Chevaleret, 75013, Paris

    Jean Fonlupt (Professeur émérite)

  3. Panthéon-Sorbonne Centre d’économie de la Sorbonne, Université Paris-I, 106-112, boulevard de l’Hôpital, 75013, Paris

    Alexandre Skoda

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

  3. Jean Fonlupt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexandre Skoda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag France

About this chapter

Cite this chapter

Korte, B., Vygen, J., Fonlupt, J., Skoda, A. (2010). Algorithmes de programmation linéaire. In: Optimisation combinatoire. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-287-99037-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-2-287-99037-3_4

  • Publisher Name: Springer, Paris

  • Print ISBN: 978-2-287-99036-6

  • Online ISBN: 978-2-287-99037-3

Publish with us

Policies and ethics

Search

Navigation