Mathematical Programming

, Volume 19, Issue 1, pp 213–219 | Cite as

Computational complexity of parametric linear programming

  • Katta G. Murty
Article

Abstract

We establish that in the worst case, the computational effort required for solving a parametric linear program is not bounded above by a polynomial in the size of the problem.

Key words

Parametric Linear Program Computational Complexity Worst Case Behavior Exponential Growth 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).Google Scholar
  2. [2]
    S.I. Gass,Linear programming: Methods and applications, 4th Edition (McGraw-Hill, New York, 1975).Google Scholar
  3. [3]
    K.G. Murty,Linear and combinatorial programming (Wiley, New York, 1976).Google Scholar
  4. [4]
    K.G. Murty, “Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73.Google Scholar

Copyright information

© The Mathematical Programming Society 1980

Authors and Affiliations

  • Katta G. Murty
    • 1
  1. 1.The University of MichiganAnn ArborUSA

Personalised recommendations