论文信息 - 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. - 字舞流文

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.

[1] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[2] Steven Vajda,et al. Linear Programming. Methods and Applications , 1964 .

[3] K. G. Murty. Computational complexity of complementary pivot methods , 1978 .

[4] Katta G. Murty,et al. Linear and combinatorial programming , 1976 .