Two-stage Combinatorial Optimization Problems under Risk

In this paper a class of combinatorial optimization problems is discussed. It is assumed that a solution can be constructed in two stages. The current first-stage costs are precisely known, while the future second-stage costs are only known to belong to an uncertainty set, which contains a finite number of scenarios with known probability distribution. A partial solution, chosen in the first stage, can be completed by performing an optimal recourse action, after the true second-stage scenario is revealed. A solution minimizing the Conditional Value at Risk (CVaR) measure is computed. Since expectation and maximum are boundary cases of CVaR, the model generalizes the traditional stochastic and robust two-stage approaches, previously discussed in the existing literature. In this paper some new negative and positive results are provided for basic combinatorial optimization problems such as the selection or network problems.

[1]  Clemens Thielen,et al.  Assortment planning for multiple chain stores , 2018, OR Spectr..

[2]  Alexandre Dolgui,et al.  Min–max and min–max (relative) regret approaches to representatives selection problem , 2012, 4OR.

[3]  Gerhard J. Woeginger,et al.  Complexity and in-approximability of a selection problem in robust optimization , 2013, 4OR.

[4]  Peter Eades,et al.  On Optimal Trees , 1981, J. Algorithms.

[5]  Adam Kurpisz,et al.  Approximability of the robust representatives selection problem , 2014, Oper. Res. Lett..

[6]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[7]  Eli Upfal,et al.  Commitment under uncertainty: Two-stage stochastic matching problems , 2007, Theor. Comput. Sci..

[8]  Mohit Singh,et al.  On Two-Stage Stochastic Minimum Spanning Trees , 2005, IPCO.

[9]  Noga Alon,et al.  A Note on Network Reliability , 1995 .

[10]  Eli Upfal,et al.  Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems , 2007, ICALP.

[11]  A. Frieze,et al.  On the random 2-stage minimum spanning tree , 2006 .

[12]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[13]  J Figueira,et al.  Stochastic Programming , 1998, J. Oper. Res. Soc..

[14]  Laurent El Ghaoui,et al.  Robust Optimization , 2021, ICORES.

[15]  Adam Kasperski,et al.  On the approximability of robust spanning tree problems , 2010, Theor. Comput. Sci..

[16]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[17]  RaghavanPrabhakar.  Probabilistic construction of deterministic algorithms: approximating packing integer programs , 1988 .

[18]  Adam Kasperski,et al.  Risk-averse single machine scheduling: complexity and approximation , 2019, J. Sched..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  G. Pflug.  Some Remarks on the Value-at-Risk and the Conditional Value-at-Risk , 2000 .

[21]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[22]  Peter Kall,et al.  Stochastic Linear Programming , 1975 .

[23]  R. Wets,et al.  Stochastic programming , 1989 .

[24]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[25]  Stefan Nickel,et al.  A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice , 2020 .

[26]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[27]  Adam Kasperski,et al.  Robust recoverable and two-stage selection problems , 2015, Discret. Appl. Math..