Bilevel Programming Problem with Quantile Follower's Objective Function

Abstract

We consider a bilevel programming problem. The leader’s objective function is assumed to be linear. The follower’s problem is a quantile minimization problem. It is assumed that the follower’s loss function is bilinear. We obtain a deterministic equivalent of the original problem in the case of a scalar random variable. In the case of the normal distribution of the random vector, an algorithm to solve the follower’s problem is suggested. We consider an economic model example to illustrate the suggested method. Results of computation are described.

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Ivanov2016BilevelPP, title={Bilevel Programming Problem with Quantile Follower's Objective Function}, author={Sergey Ivanov and Vera Korbulakova}, booktitle={DOOR}, year={2016} }