论文信息 - The computational complexity of multi-level linear programs

The computational complexity of multi-level linear programs

We show that (L+1)-level linear programs are as difficult as levelL of the polynomial-time hierarchy, even if one only considers problems with unique optimal solutions.

Charles Blair | Charles Blair

[1] Charles E. Blair,et al. Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[2] B. McCarl,et al. The Potential Role of Multilevel Programming in Agricultural Economics , 1981 .

[3] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[4] Robert G. Jeroslow,et al. The polynomial hierarchy and a simple model for competitive analysis , 1985, Math. Program..

[5] Jonathan F. Bard,et al. An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..