×

zbMATH — the first resource for mathematics

Computational complexity of parametric linear programming. (English) Zbl 0443.90102

MSC:
90C31 Sensitivity, stability, parametric optimization
90C05 Linear programming
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
[2] S.I. Gass,Linear programming: Methods and applications, 4th Edition (McGraw-Hill, New York, 1975). · Zbl 0354.90048
[3] K.G. Murty,Linear and combinatorial programming (Wiley, New York, 1976). · Zbl 0334.90032
[4] K.G. Murty, ”Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73. · Zbl 0381.90108
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.