## Abstract 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 s
β¦ LIBER β¦
A bilevel bottleneck programming problem
β Scribed by Kanchan Mathur; M.C. Puri
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 553 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On a stochastic bilevel programming prob
β
Stefanie Kosuch; Pierre Le Bodic; Janny Leung; Abdel Lisser
π
Article
π
2011
π
John Wiley and Sons
π
English
β 160 KB
On the bottleneck linear programming pro
β
C.R. Seshan; K.K. Achary
π
Article
π
1982
π
Elsevier Science
π
English
β 522 KB
Optimality conditions for the bilevel pr
β
Jonathan F. Bard
π
Article
π
1984
π
John Wiley and Sons
π
English
β 697 KB
A bilevel programming approach to the tr
β
Patrice Marcotte; Gilles Savard; FrΓ©dΓ©ric Semet
π
Article
π
2004
π
Elsevier Science
π
English
β 226 KB
An algorithm for the discrete bilevel pr
β
Jonathan F. Bard; James T. Moore
π
Article
π
1992
π
John Wiley and Sons
π
English
β 915 KB
The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting
Efficient solutions for the linear bilev
β
Ue-Pyng Wen; Shuh-Tzy Hsu
π
Article
π
1992
π
Elsevier Science
π
English
β 610 KB