Polymatroids and mean-risk minimization in discrete optimization

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.

[1]  Shabbir Ahmed,et al.  Convexity and decomposition of mean-risk stochastic programs , 2006, Math. Program..

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[4]  Hiroaki Ishii,et al.  Stochastic spanning tree problem , 1981, Discret. Appl. Math..

[5]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[6]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[7]  H. Föllmer,et al.  Stochastic Finance: An Introduction in Discrete Time , 2002 .

[8]  Alper Atamtürk,et al.  Cuts for Conic Mixed-Integer Programming , 2007, IPCO.

[9]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[10]  Mark S. Daskin,et al.  Capacitated warehouse location model with risk pooling , 2008 .

[11]  Melvyn Sim,et al.  Robust linear optimization under general norms , 2004, Oper. Res. Lett..

[12]  Arkadi Nemirovski,et al.  Robust optimization – methodology and applications , 2002, Math. Program..

[13]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[14]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[15]  藤重 悟.  Submodular functions and optimization , 1991 .

[16]  George L. Nemhauser,et al.  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..

[17]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[18]  Laurent El Ghaoui,et al.  Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach , 2003, Oper. Res..

[19]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[21]  Zuo-Jun Max Shen,et al.  A Joint Location - Inventory Model , 2003, Transp. Sci..

[22]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[23]  Ioana Popescu,et al.  Optimal Inequalities in Probability Theory: A Convex Optimization Approach , 2005, SIAM J. Optim..

[24]  W. Sharpe,et al.  Mean-Variance Analysis in Portfolio Choice and Capital Markets , 1987 .

[25]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[26]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[27]  Alper Atamtürk.  Strong Formulations of Robust Mixed 0–1 Programming , 2006, Math. Program..