期刊
MANAGEMENT SCIENCE
卷 61, 期 3, 页码 586-603出版社
INFORMS
DOI: 10.1287/mnsc.2013.1865
关键词
priority lists; activity-selection problem; stochastic programming; cutting planes
资金
- Electric Power Research Institute [EP-P22134/C10834]
- National Science Foundation [CMMI-0653916, CMMI-0855577]
We take a novel approach to decision problems involving binary activity-selection decisions competing for scarce resources. The literature approaches such problems by forming an optimal portfolio of activities. However, often practitioners instead form a rank-ordered list of activities and select those with the highest priority. We account for both viewpoints. We rank activities considering both the uncertainty in the problem parameters and the optimal portfolio that will be obtained once the uncertainty is revealed. We use stochastic integer programming as a modeling framework, and we apply our approach to a facility location problem and a multidimensional knapsack problem. We develop two sets of cutting planes to improve computation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据