Prioritization via stochastic optimization

Ali Koç, David P. Morton

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)586-603
Number of pages18
JournalManagement Science
Volume61
Issue number3
DOIs
StatePublished - Mar 1 2015
Externally publishedYes

Keywords

  • Activity-selection problem
  • Cutting planes
  • Priority lists
  • Stochastic programming

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Prioritization via stochastic optimization'. Together they form a unique fingerprint.

Cite this