SOME PROPERTIES OF THE BILEVEL PROGRAMMING PROBLEM

被引：253
|
作者：
BARD, JF
机构：
[1] Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas
来源：
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1991年 / 68卷 / 02期
关键词：
BILEVEL PROGRAMMING; STACKELBERG GAMES; COMPUTATIONAL COMPLEXITY;
D O I：
10.1007/BF00941574
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
下载
收藏
页码：371 / 378
页数：8
相关论文
共 50 条
12345