| Article ID: | iaor20102951 |
| Volume: | 37 |
| Issue: | 3 |
| Start Page Number: | 215 |
| End Page Number: | 218 |
| Publication Date: | May 2009 |
| Journal: | Operations Research Letters |
| Authors: | Hanafi Sad, Brotcorne Luce, Mansi Rad |
| Keywords: | knapsack problem, programming (bilevel) |
We propose an efficient dynamic programming algorithm for solving a bilevel program where the leader controls the capacity of a knapsack, and the follower solves the resulting knapsack problem. We propose new recursive rules and show how to solve the problem as a sequence of two standard knapsack problems.