Computational complexity of parametric linear programming
- 252 Downloads
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 wordsParametric Linear Program Computational Complexity Worst Case Behavior Exponential Growth
Unable to display preview. Download preview PDF.
- G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).Google Scholar
- S.I. Gass,Linear programming: Methods and applications, 4th Edition (McGraw-Hill, New York, 1975).Google Scholar
- K.G. Murty,Linear and combinatorial programming (Wiley, New York, 1976).Google Scholar
- K.G. Murty, “Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73.Google Scholar
© The Mathematical Programming Society 1980