Bilevel programming involves two optimization problems where the constraint region of the ยฎrst level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel linear/linear fractional programming problem in which the objective function of the ยฎrst level
โฆ LIBER โฆ
Discrete linear bilevel programming problem
โ Scribed by L. Vicente; G. Savard; J. Judice
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 628 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The bilevel linear/linear fractional pro
โ
Herminia I. Calvete; Carmen Galรฉ
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 140 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
Test problem construction for linear bil
โ
Khosrow Moshirvaziri; Mahyar A. Amouzegar; Stephen E. Jacobsen
๐
Article
๐
1996
๐
Springer US
๐
English
โ 399 KB
A bilevel bottleneck programming problem
โ
Kanchan Mathur; M.C. Puri
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 553 KB
Characterizing an optimal solution to th
โ
Yi-Hsin Liu; Stephen M. Hart
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 155 KB