Mathematical Programming

, Volume 19, Issue 1, pp 213–219

Computational complexity of parametric linear programming

  • Katta G. Murty

DOI: 10.1007/BF01581642

Cite this article as:
Murty, K.G. Mathematical Programming (1980) 19: 213. doi:10.1007/BF01581642


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 

Copyright information

© The Mathematical Programming Society 1980

Authors and Affiliations

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

Personalised recommendations