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.
Similar content being viewed by others
References
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
S.I. Gass,Linear programming: Methods and applications, 4th Edition (McGraw-Hill, New York, 1975).
K.G. Murty,Linear and combinatorial programming (Wiley, New York, 1976).
K.G. Murty, “Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73.
Author information
Authors and Affiliations
Additional information
This research is partially supported by Air Force Office of Scientific Research, Air Force Number AFOSR-78-3646.
Rights and permissions
About this article
Cite this article
Murty, K.G. Computational complexity of parametric linear programming. Mathematical Programming 19, 213–219 (1980). https://doi.org/10.1007/BF01581642
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581642