Variable neighborhood search for stochastic linear programming problem with quantile criterion

We consider the stochastic linear programming problem with quantile criterion and continuous distribution of random parameters. Using the sample approximation, we obtain a stochastic programming problem with discrete distribution of random parameters. It is known that the solution to this problem provides an approximate solution to the problem with continuous random parameters if the size of the sample is large enough. Applying the confidence method, we reduce the problem to a mixed integer programming problem, which is linear with respect to continuous variables. Integer variables determine confidence sets, and we describe the structure of the optimal confidence set. This property allows us to take into account only confidence sets that may be optimal. To find an approximate solution to the problem, we suggest a modification of the variable neighborhood search and determine structures of neighborhoods used in the search. Also, we discuss a method to find a good initial solution and give results of numerical experiments. We apply the developed algorithm to solve a problem of optimization of a hospital budget.

[1]  M. Queyranne,et al.  Budgeting Costs of Nursing in a Hospital , 1985 .

[2]  Andrey I. Kibzun,et al.  Stochastic Programming Problems with Probability and Quantile Functions , 1996 .

[3]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[4]  Andrey I. Kibzun,et al.  On the Convergence of Sample Approximations for Stochastic Programming Problems with Probabilistic Criteria , 2018, Autom. Remote. Control..

[5]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[6]  A. V. Naumov,et al.  Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters , 2012 .

[7]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

[9]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[10]  Alexander Shapiro,et al.  Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.

[11]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[12]  Andrey V. Naumov,et al.  On stochastic linear programming problems with the quantile criterion , 2011 .

[13]  A. V. Naumov,et al.  Two-stage problem of quantile optimization of an investment project , 2010 .

[14]  R. Wets,et al.  Consistency of Minimizers and the SLLN for Stochastic Programs 1 , 1995 .

[15]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..