Journal
NETWORKS
Volume 59, Issue 1, Pages 107-116Publisher
WILEY-BLACKWELL
DOI: 10.1002/net.20482
Keywords
bilevel; stochastic; optimization; networks; pricing
Funding
- France/HongKong Joint Research Scheme [PROCORE F-HK09/07T]
- GRF (Hong Kong Research Grants Council) [414608]
Ask authors/readers for more resources
In this article, a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level is proposed. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a service provider and customers. A discrete probability space is assumed which allows a reformulation of the problem as an equivalent deterministic bilevel problem. The problem is further transformed into a linear bilevel problem, which in turn yields a quadratic optimization problem, namely the global linear complementarity problem. Based on this quadratic problem, a procedure to compute upper bounds on the initial problem by using a Lagrangian relaxation and an iterative linear minmax scheme is proposed. Numerical experiments confirm that the scheme practically converges. (C) 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 59(1), 107-116 2012
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available