An Exact Algorithm for Bilevel 0-1 Knapsack Problems

Table 1

An optimal solution for HBKP (Example 3.5).

	𝑥1	𝑥2	𝑥3	𝑦1	𝑦2	𝑦3	𝑦4
(𝑥,𝑦)	0	0	1	1	0	1	0
(𝑑^1,𝑑^2)	−3	0	3	3	−3	0	−7
Basic variable	no	no	no	no	no	yes	no
Variable can be fixed	yes	no	yes	yes	yes	no	yes