Abstract:
Under study is a bilevel stochastic linear programming problem with quantile criterion. Bilevel programming problems can be considered as formalization of the process of interaction between two parties. The first party is a Leader making a decision first; the second is a Follower making a decision knowing the Leader's strategy and the realization of the random parameters. It is assumed that the Follower's problem is linear if the realization of the random parameters and the Leader's strategy are given. The aim of the Leader is the minimization of the quantile function of a loss function that depends on his own strategy and the optimal Follower's strategy. It is shown that the Follower's problem has a unique solution with probability 1 if the distribution of the random parameters is absolutely continuous. The lower-semicontinuity of the loss function is proved and some conditions are obtained of the solvability of the problem under consideration. Some example shows that the continuity of the quantile function cannot be provided. The sample average approximation of the problem is formulated. The conditions are given to provide that, as the sample size increases, the sample average approximation converges to the original problem with respect to the strategy and the objective value. It is shown that the convergence conditions hold for almost all values of the reliability level. A model example is given of determining the tax rate, and the numerical experiments are executed for this example. Tab. 1, illustr. 2, bibliogr. 13.
Keywords:stochastic programming, bilevel problem, quantile criterion, value-at-risk, sample average approximation.