期刊
OPERATIONS RESEARCH LETTERS
卷 38, 期 4, 页码 328-333出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2010.04.005
关键词
Bilevel programming; Stochastic integer programming; Value functions
资金
- National Science Foundation [CMMI-0826141, DMI-0620780]
- AFOSR [FA9550-08-1-0268]
- University of Pittsburgh
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [0826141] Funding Source: National Science Foundation
We introduce the bilevel knapsack problem with stochastic right-hand sides, and provide necessary and sufficient conditions for the existence of an optimal solution. When the leader's decisions can take only integer values, we present an equivalent two-stage stochastic programming reformulation with binary recourse. We develop a branch-and-cut algorithm for solving this reformulation, and a branch-and-backtrack algorithm for solving the scenario subproblems. Computational experiments indicate that our approach can solve large instances in a reasonable amount of time. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据