☆ 4.5 Article

The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2022)

Related references

Note: Only part of the references are listed.

Article Operations Research & Management Science

The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective

Christoph Buchheim et al.

Summary: This study investigates a bilevel continuous knapsack problem with uncertainty and robust optimization. The complexity of the problem varies depending on the type of uncertainty sets, with some cases being solvable in polynomial time and others being NP-hard. The results provide insights into the impacts of uncertainty and robust optimization in bilevel problems.

JOURNAL OF GLOBAL OPTIMIZATION (2022)

Add to Collection

Article Operations Research & Management Science

On the complexity of robust bilevel optimization with uncertain follower's objective

Christoph Buchheim et al.

Summary: This study examines the complexity of bilevel combinatorial optimization with uncertainty in the follower's objective using a robust optimization approach. It shows that under interval uncertainty, the robust counterpart of the bilevel problem can be Sigma(P)(2)- hard, even when the certain bilevel problem is NP-equivalent and the follower's problem is tractable. Conversely, in the case of discrete uncertainty, the robust bilevel problem is at most one level harder than the follower's problem.

OPERATIONS RESEARCH LETTERS (2021)

Add to Collection

Article Computer Science, Software Engineering