A global optimization method for nonlinear bilevel programming problems

被引:41
作者
Amouzegar, MA [1 ]
机构
[1] RAND Corp, Santa Monica, CA 90407 USA
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS | 1999年 / 29卷 / 06期
关键词
DC programming; global optimization; nonlinear bilevel optimization; Stackelberg game;
D O I
10.1109/3477.809031
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nonlinear two-level programming deals with optimization problems in which the constraint region is implicitly determined by another optimization problem. Mathematical programs of this type arise in connection with policy problems to which the Stackelberg leader-follower game is applicable, In this paper, the nonlinear bilevel programming problem is restated as a global optimization problem and a new solution method based on this approach is developed. The most important feature of this new method is that it attempts to take full advantage of the structure in the constraints using some recent global optimization techniques.
引用
收藏
页码:771 / 777
页数:7
相关论文
共 22 条
[1]  
AIYOSHI E, 1981, IEEE T SYST MAN CYB, V11, P444
[2]  
Al-Khayyal F. A., 1992, Annals of Operations Research, V34, P125, DOI 10.1007/BF02098176
[3]  
AMOUZEGAR MA, 1999, EUR J OPER RES, V119
[4]  
AMOUZEGAR MA, 1998, J APPL MATH DECIS SC, V2
[5]  
AMOUZEGAR MA, 1997, MULTILEVEL OPTIMIZAT, pCH11
[6]   REGULATING NON-NUCLEAR INDUSTRIAL-WASTES BY HAZARD CLASSIFICATION [J].
BARD, JF .
JOURNAL OF ENVIRONMENTAL SYSTEMS, 1983, 13 (01) :21-41
[7]   CONVEX 2-LEVEL OPTIMIZATION [J].
BARD, JF .
MATHEMATICAL PROGRAMMING, 1988, 40 (01) :15-27
[8]   A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
MOORE, JT .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292
[9]   A LINEAR 2-LEVEL PROGRAMMING PROBLEM [J].
CANDLER, W ;
TOWNSLEY, R .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :59-76
[10]   ALGORITHMS FOR NONLINEAR BILEVEL MATHEMATICAL PROGRAMS [J].
EDMUNDS, TA ;
BARD, JF .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (01) :83-89