Mathematical Programming

, Volume 44, Issue 1–3, pp 203–212 | Cite as

A randomized algorithm for fixed-dimensional linear programming

  • M. E. Dyer
  • A. M. Frieze


We give a (Las Vegas) randomized algorithm for linear programming in a fixed dimensiond for which the expected computation time is\(O(d^{(3 + \varepsilon _d )d} n)\), where limd→∞εd = 0. This improves the corresponding worst-case complexity,\(O(3^{d^2 } n)\). The method is based on a recent idea of Clarkson. Two variations on the algorithm are examined briefly.

Key words

Linear programming randomized algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.L. Clarkson, “Linear programming in\(O(n \times 3^{d^2 } )\) time,”Information Processing Letters 22 (1986) 21–24.Google Scholar
  2. [2]
    K.L. Clarkson, “New applications of random sampling to computational geometry,”Journal of Discrete and Computational Geometry 2 (1987), 195–222.Google Scholar
  3. [3]
    M.E. Dyer, “Linear time algorithms for two- and three-variable linear programs,”SIAM Journal on Computing 13 (1984) 31–45.Google Scholar
  4. [4]
    M.E. Dyer, “On a multidimensional search problem and its application to the Euclidean one-centre problem,”SIAM Journal on Computing 15 (1986) 725–738.Google Scholar
  5. [5]
    D. Haussler and E. Welzl, “ε-nets and simplex range queries,”Discrete and Computational Geometry 2 (1987) 127–151.Google Scholar
  6. [6]
    W. Hoeffding, “Probability inequalities for sums of bounded random variables,”Journal of the American Statistical Association 58 (1963) 13–30.Google Scholar
  7. [7]
    N. Megiddo, “Linear-time algorithms for linear programming ℝ3 and related problems,”SIAM Journal on Computing 12 (1983) 759–776.Google Scholar
  8. [8]
    N. Megiddo, “Linear programming in linear time when the dimension is fixed,”Journal of the Association for Computing Machinery 31 (1984) 114–127.Google Scholar
  9. [9]
    A. Schrijver,Theory of Linear and Integer Programming (Wiley, Chichester, 1986).Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1989

Authors and Affiliations

  • M. E. Dyer
    • 1
  • A. M. Frieze
    • 2
    • 3
  1. 1.University of LeedsLeedsUK
  2. 2.Carnegie-Mellon UniversityPittsburghUSA
  3. 3.Queen Mary CollegeLondonUK

Personalised recommendations