Advertisement

Complexity of the gravitational method for linear programming

  • T. L. Morin
  • N. Prabhu
  • Z. Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1180)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Chang S Y and Murty K G, The Steepest Descent Gravitational Method for LP, Discrete Applied Mathematics, Vol. 25, 211–240, 1989.Google Scholar
  2. [2]
    Dantzig G B, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.Google Scholar
  3. [3]
    Goldfarb D and Sit W, Worst Case Behavior of the Steepest Edge Simplex Method, Discrete Applied Mathematics 4, 367–377, 1973.Google Scholar
  4. [4]
    Klee V and Kleinschmidt P, The d-step Conjecture and its Relatives, Mathematics of Operations Research 12, 718–755, 1987.Google Scholar
  5. [5]
    Klee V and Minty G J, How Good is the Simplex Algorithm?, in: Inequalities III (O. Shisha, ed), Academic Press, New York, 159–175, 1972.Google Scholar
  6. [6]
    Murty K G, The Gravitational Method for LP, OPSEARCH, Vol. 23, No. 4, 206–214, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • T. L. Morin
    • 1
  • N. Prabhu
    • 1
  • Z. Zhang
    • 1
  1. 1.Purdue UniversityWest Lafayette

Personalised recommendations