| Article ID: | iaor20012969 |
| Country: | Germany |
| Volume: | 8 |
| Issue: | 2 |
| Start Page Number: | 93 |
| End Page Number: | 107 |
| Publication Date: | Apr 2000 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Dempe Stephan, Richter Katrin |
| Keywords: | knapsack problem |
A special class of bilevel programming problems with discrete parametric lower level problems is considered. First, necessary and sufficient conditions for the existence of optimal solutions are given. Then, a pseudopolynomial exact and a polynomial approximate algorithms for solving the bilevel problem are proposed.