Back to Search
Start Over
THE COMPUTATIONAL COMPLEXITY OF MULTI-LEVEL LINEAR PROGRAMS.
- Source :
- Annals of Operations Research; 1992, Vol. 34 Issue 1-4, p13-19, 7p
- Publication Year :
- 1992
-
Abstract
- We show that (L + l)-level linear programs are as difficult as level L of the polynomial-time hierarchy, even if one only considers problems with unique optimal solutions. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 34
- Issue :
- 1-4
- Database :
- Complementary Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 18698235
- Full Text :
- https://doi.org/10.1007/BF02098170