Computational complexity of parametric linear programming
- Katta G. Murty
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- 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.
- Computational complexity of parametric linear programming
Volume 19, Issue 1 , pp 213-219
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Parametric Linear Program
- Computational Complexity
- Worst Case Behavior
- Exponential Growth
- Industry Sectors
- Katta G. Murty (1)
- Author Affiliations
- 1. The University of Michigan, Ann Arbor, MI, USA