The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This followed by a proof that the BLPP is NP-hard.
机构:
Univ Paris 11, Rech Informat Lab, F-91405 Orsay, FranceUniv Paris 11, Rech Informat Lab, F-91405 Orsay, France
Kosuch, Stefanie
Le Bodic, Pierre
论文数: 0引用数: 0
h-index: 0
机构:
Univ Paris 11, Rech Informat Lab, F-91405 Orsay, FranceUniv Paris 11, Rech Informat Lab, F-91405 Orsay, France
Le Bodic, Pierre
Leung, Janny
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R ChinaUniv Paris 11, Rech Informat Lab, F-91405 Orsay, France
Leung, Janny
Lisser, Abdel
论文数: 0引用数: 0
h-index: 0
机构:
Univ Paris 11, Rech Informat Lab, F-91405 Orsay, FranceUniv Paris 11, Rech Informat Lab, F-91405 Orsay, France