Global optimization of nonlinear bilevel programming problems

被引:136
作者
Gümüs, ZH [1 ]
Floudas, CA [1 ]
机构
[1] Princeton Univ, Dept Chem Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
bilevel programming; bilevel optimization; twice-continuously differentiable; global optimization; bilevel nonlinear; nonconvex; mixed integer nonlinear optimization;
D O I
10.1023/A:1011268113791
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A novel technique that addresses the solution of the general nonlinear bilevel programming problem to global optimality is presented. Global optimality is guaranteed for problems that involve twice differentiable nonlinear functions as long as the linear independence constraint qualification condition holds for the inner problem constraints. The approach is based on the relaxation of the feasible region by convex underestimation, embedded in a branch and bound framework utilizing the basic principles of the deterministic global optimization algorithm, alpha BB [2, 4, 5, 11]. Epsilon global optimality in a finite number of iterations is theoretically guaranteed. Computational studies on several literature problems are reported.
引用
收藏
页码:1 / 31
页数:31
相关论文
共 67 条
[1]  
Adjiman CS, 1997, COMPUT CHEM ENG, V21, pS445
[2]   Global optimization of mixed-integer nonlinear problems [J].
Adjiman, CS ;
Androulakis, IP ;
Floudas, CA .
AICHE JOURNAL, 2000, 46 (09) :1769-1797
[3]   A global optimization method, αBB, for general twice-differentiable constrained NLPs -: I.: Theoretical advances [J].
Adjiman, CS ;
Dallwig, S ;
Floudas, CA ;
Neumaier, A .
COMPUTERS & CHEMICAL ENGINEERING, 1998, 22 (09) :1137-1158
[4]   Rigorous convex underestimators for general twice-differentiable problems [J].
Adjiman, CS ;
Floudas, CA .
JOURNAL OF GLOBAL OPTIMIZATION, 1996, 9 (01) :23-40
[5]   A global optimization method, αBB, for general twice-differentiable constrained NLPs -: II.: Implementation and computational results [J].
Adjiman, CS ;
Androulakis, IP ;
Floudas, CA .
COMPUTERS & CHEMICAL ENGINEERING, 1998, 22 (09) :1159-1179
[6]  
AIYOSHI E, 1996, IEEE T SYS MAN CYB, V11, P444
[7]  
Al-Khayyal F. A., 1992, Annals of Operations Research, V34, P125, DOI 10.1007/BF02098176
[8]   JOINTLY CONSTRAINED BICONVEX PROGRAMMING [J].
ALKHAYYAL, FA ;
FALK, JE .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (02) :273-286
[9]   A global optimization method for nonlinear bilevel programming problems [J].
Amouzegar, MA .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1999, 29 (06) :771-777
[10]   A SOLUTION METHOD FOR THE LINEAR STATIC STACKELBERG PROBLEM USING PENALTY-FUNCTIONS [J].
ANANDALINGAM, G ;
WHITE, DJ .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1990, 35 (10) :1170-1173