4.2 Article

Polymatroids and mean-risk minimization in discrete optimization

Journal

OPERATIONS RESEARCH LETTERS
Volume 36, Issue 5, Pages 618-622

Publisher

ELSEVIER
DOI: 10.1016/j.orl.2008.04.006

Keywords

Conic integer programming; Value-at-risk; Ellipsoidal uncertainty sets; Submodular functions

Funding

  1. National Science Foundation [0700203]
  2. Directorate For Engineering
  3. Div Of Civil, Mechanical, & Manufact Inn [0700203] Funding Source: National Science Foundation

Ask authors/readers for more resources

We study discrete optimization problems with a submodular mean-risk minimization objective. For-0-1 problems a linear characterization of the convex lower envelope is given. For mixed 0-1 problems we derive an exponential class of conic quadratic valid inequalities. We report computational experiments on risk-averse capital budgeting problems with uncertain returns. (c) 2008 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available