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
โฆ LIBER โฆ
Co-evolutionary algorithm: An efficient approach for bilevel programming problems
โ Scribed by Li, Hecheng; Fang, Lei
- Book ID
- 125837861
- Publisher
- Taylor and Francis Group
- Year
- 2013
- Tongue
- English
- Weight
- 291 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0305-215X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An algorithm for the discrete bilevel pr
โ
Jonathan F. Bard; James T. Moore
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 915 KB
An interval number programming approach
โ
Abass, Samir A.
๐
Article
๐
2010
๐
Informa UK (Taylor & Francis)
๐
English
โ 298 KB
Finding an efficient solution to linear
โ
Ue-Pyng Wen; Sen-Fon Lin
๐
Article
๐
1996
๐
Springer US
๐
English
โ 527 KB
Multilevel programming is developed to solve the decentralized problem in which decision makers (DMs) are often arranged within a hierarchical administrative structure. The linear bilevel programming (BLP) problem, i.e., a special case of multilevel programming problems with a two level structure, i
An algorithm for the mixed-integer nonli
โ
Thomas A. Edmunds; Jonathan F. Bard
๐
Article
๐
1992
๐
Springer US
๐
English
โ 814 KB
An adaptive genetic algorithm for solvin
โ
Guang-min Wang; Xian-jia Wang; Zhong-ping Wan; Shi-hui Jia
๐
Article
๐
2007
๐
Springer
๐
English
โ 215 KB
An algorithm for the integer linear frac
โ
Thirwani, D.; Arora, S. R.
๐
Article
๐
1997
๐
Taylor and Francis Group
๐
English
โ 290 KB