Mathematical Programming

, Volume 19, Issue 1, pp 213–219

Computational complexity of parametric linear programming

Authors

  • Katta G. Murty
    • The University of Michigan
Article

DOI: 10.1007/BF01581642

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

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 ProgramComputational ComplexityWorst Case BehaviorExponential Growth

Copyright information

© The Mathematical Programming Society 1980